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:
from sys import stdin, stdout


n = int(stdin.readline())
for i in range(n):
    l1 = stdin.readline()
    l1 = [int(x) for x in list(l1[:-1])]
    if l1[0]!=9:
        l1[0]+=1
    else:
        l1[0]=1
    l11 = ''
    for x in l1:
        l11 += str(x)
    l2 = stdin.readline()
    l2 = [int(x) for x in list(l2[:-1])]
    if l2[4]!=9:
        l2[4]+=1
    else:
        l2[4]=1
    l21 = ''
    for x in l2:
        l21 += str(x)
    l3 = stdin.readline()
    l3 = [int(x) for x in list(l3[:-1])]
    if l3[8]!=9:
        l3[8]+=1
    else:
        l3[8]=1
    l31 = ''
    for x in l3:
        l31 += str(x)
    l4 = stdin.readline()
    l4 = [int(x) for x in list(l4[:-1])]
    if l4[6]!=9:
        l4[6]+=1
    else:
        l4[6]=1
    l41 = ''
    for x in l4:
        l41 += str(x)
    l5 = stdin.readline()
    l5 = [int(x) for x in list(l5[:-1])]
    if l5[1]!=9:
        l5[1]+=1
    else:
        l5[1]=1
    l51 = ''
    for x in l5:
        l51 += str(x)
    l6 = stdin.readline()
    l6 = [int(x) for x in list(l6[:-1])]
    if l6[5]!=9:
        l6[5]+=1
    else:
        l6[5]=1
    l61 = ''
    for x in l6:
        l61 += str(x)
    l7 = stdin.readline()
    l7 = [int(x) for x in list(l7[:-1])]
    if l7[3]!=9:
        l7[3]+=1
    else:
        l7[3]=1
    l71 = ''
    for x in l7:
        l71 += str(x)
    l8 = stdin.readline()
    l8 = [int(x) for x in list(l8[:-1])]
    if l8[7]!=9:
        l8[7]+=1
    else:
        l8[7]=1
    l81 = ''
    for x in l8:
        l81 += str(x)
    l9 = stdin.readline()
    l9 = [int(x) for x in list(l9[:-1])]
    if l9[2]!=9:
        l9[2]+=1
    else:
        l9[2]=1
    l91 = ''
    for x in l9:
        l91 += str(x)

    stdout.write(l11 + '\n')
    stdout.write(l21 + '\n')
    stdout.write(l31 + '\n')
    stdout.write(l41 + '\n')
    stdout.write(l51 + '\n')
    stdout.write(l61 + '\n')
    stdout.write(l71 + '\n')
    stdout.write(l81 + '\n')
    stdout.write(l91 + '\n')