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:
t = int(input())
for i in range(0,t):
    a = []
    for k in range(0,9):
        temp = list(map(int,input().split()))
        output = list(map(int, str(temp[0])))
        a.append(output)
    # help = [True]*9
    # print(a)
    # k = 0
    m = 0
    n = 3
    o = 6
    for i in range(0,9):
        if(i == 0 or i== 3 or i== 6):
            if(i==6):
                new = a[i][m-1]
                a[i][m] = new
            else:
                new = a[i][m+1]
                a[i][m] = new
            m+=1
        if(i == 1 or i==4 or i==7):
            if(i==7):
                new = a[i][n-1]
                a[i][n] = new
            else:
                new = a[i][n+1]
                a[i][n] = new
            n+=1
        if(i == 2 or i==5 or i== 8):
            if(i==8):
                new = a[i][o-1]
                a[i][o] = new
            else:
                new = a[i][o+1]
                a[i][o] = new
            o+=1



    for i in range(0,9):
        for k in range(0,9):
            if(k == 8):
                print(a[i][k])
            else:
                print(a[i][k],end="")