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:
cases = int(input())

i = 0

cont = []
def convert():
    for i in range(0,9):
        cont = sdk[i]
        index = 0
        numb = 0
        for j in range(0,9):
            numb = (numb * 10) + cont[index]
            index = index + 1
        print(numb)

def solver():
    if sdk[0][0] == 1:
        key1 = 3
        key2 = 2
    else:
        key1 = 1
        key2 = 3

    if sdk[0][0] == key1:
        sdk[0][0] = key2
    else:
        sdk[0][0] = key1
    if sdk[8][8] == key1:
        sdk[8][8] = key2
    else:
        sdk[8][8] = key1
    if sdk[5][7] == key1:
        sdk[5][7] = key2
    else:
        sdk[5][7] = key1
    if sdk[7][5] == key1:
        sdk[7][5] = key2
    else:
        sdk[7][5] = key1
    if sdk[4][4] == key1:
        sdk[4][4] = key2
    else:
        sdk[4][4] = key1
    if sdk[2][6] == key1:
        sdk[2][6] = key2
    else:
        sdk[2][6] = key1
    if sdk[1][3] == key1:
        sdk[1][3] = key2
    else:
        sdk[1][3] = key1
    if sdk[6][2] == key1:
        sdk[6][2] = key2
    else:
        sdk[6][2] = key1
    if sdk[3][1] == key1:
        sdk[3][1] = key2
    else:
        sdk[3][1] = key1

    convert()

row = [0,0,0,0,0,0,0,0,0]
sdk = [[ 0 for i in range(0,9)] for j in range(0,9)]
while i < cases:
    for p in range(0,9):
        val = int(input())
        ind = 8
        for x in range(0,9):
            row[ind] = val % 10
            val = int(val / 10)
            ind = ind - 1
        for j in range(0,9):
            sdk[p][j] = row[j]
    #print(sdk)
    solver()
    i = i + 1