Sequence Transformation

You are given a list of numerical sequences. For each sequence, every digit is replaced by ( (d+1) \mod 10 ), i.e. each digit ( d ) is increased by 1 and if ( d = 9 ), it wraps around to 0. The task is to transform each sequence accordingly and output the resulting transformed sequence. This problem simulates simple digit manipulation and requires careful parsing of the input.

inputFormat

The input is read from standard input. The first line contains an integer ( n ) which denotes the number of sequences. Each of the following ( n ) lines contains a single sequence consisting of digits.

outputFormat

For each sequence, output the transformed sequence on a separate line to standard output.## sample

1
98765

09876