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:
def column(matrix, i):
    return [row[i] for row in matrix]

def print_block(sudoku, pos):
    row, col = pos
    for i in range(3):
        for j in range(3):
            print(sudoku[row*3+i][col*3+j], end="")
        print('\n')


def fill(sudoku, pos):
    row, col = pos
    i = 1
    while not(row_test(sudoku[row]) and row_test(column(sudoku, col)) and block_test(sudoku, (row//3, col//3))):
        sudoku[row][col] = i
        i = i + 1
        #print("filling {}th row, {}th col".format(row, col))
        #print_block(sudoku, (row//3, col//3))
        #block_test(sudoku, pos)

def solve(sudoku, n):
    for i in range(3):
        for j in range(3):
            padding = j
            fill(sudoku, (3*i+j, 3*j+(j+i)%3))
    test(sudoku)

def row_test(a):
    b = set(a)
    if len(b) <= 8:
        return True

def block_test(sudoku, pos):
    row, col = pos
    a = []
    for i in range(3):
        for j in range(3):
            a.append(sudoku[row*3+i][col*3+j])
    a = set(a)
    if len(a) <= 8:
        return True

def print_ans(sudoku):
    for i in range(9):
        for j in range(9):
            print(sudoku[i][j], end="")
        print("")

def test(sudoku):
    # row test
    flag = True
    for i in range(9):
        a = sudoku[i].copy()
        a.sort()
        #print("test on {}th row".format(i))
        flag = flag and row_test(a)
    # col test
    for i in range(9):
        a = column(sudoku, i).copy()
        #print("test on {}th col".format(i))
        flag = flag and row_test(a)
    # check block
    for i in range(3):
        for j in range(3):
            #print("test on {}th block".format(i*3+j))
            flag = flag and block_test(sudoku, (i, j))
    if flag:
        print_ans(sudoku)
    
def main():
    n = int(input())
    for i in range(n):
        sudoku = []
        for j in range(9):
            row = input()
            a = []
            for r in row:
                a.append(int(r))
            sudoku.append(a)
        solve(sudoku, n)

main()