Problem: You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz).

The picture showing the correct sudoku solution:

<image>

Blocks are bordered with bold black color.

Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 9 and change the number at the position (i, j) to any other number in range [1; 9]) to make it anti-sudoku. The anti-sudoku is the 9 × 9 field, in which:

  * Any number in this field is in range [1; 9]; 
  * each row contains at least two equal elements; 
  * each column contains at least two equal elements; 
  * each 3 × 3 block (you can read what is the block in the link above) contains at least two equal elements. 



It is guaranteed that the answer exists.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 10^4) — the number of test cases. Then t test cases follow.

Each test case consists of 9 lines, each line consists of 9 characters from 1 to 9 without any whitespaces — the correct solution of the sudoku puzzle.

Output

For each test case, print the answer — the initial field with at most 9 changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.

Example

Input


1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563


Output


154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563

Solution (in PYTHON3):

Solution:
import atexit
import io
import sys

_INPUT_LINES = sys.stdin.read().splitlines()
input = iter(_INPUT_LINES).__next__
_OUTPUT_BUFFER = io.StringIO()
sys.stdout = _OUTPUT_BUFFER


@atexit.register
def write():
    sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())


def box(i,j):
    i = int(i)
    j = int(j)
    a = i//3
    b = j//3
    return 3*a+b

testcases = int(input())

for case in range(testcases):
    puzzle = []
    for i in range(9):
        zax = []
        s = input()
        for j in range(9):
            zax.append(s[j])
        puzzle.append(zax)

    done_i = [False,False,False,False,False,False,False,False,False]
    done_j = [False,False,False,False,False,False,False,False,False]
    done_box = [False,False,False,False,False,False,False,False,False]
    for i in range(9):
        for j in range(9):
            if not done_i[i] and not done_j[j] and not done_box[box(i,j)]:
                val = puzzle[i][j]
                if val=="1":
                    replacement = "2"
                else:
                    replacement = "1"
                puzzle[i][j]=replacement
                done_i[i]=True
                done_j[j]=True
                done_box[box(i, j)]=True

    for i in range(9):
        print("".join(puzzle[i]))