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 find_next(board):


def valid(board, next_pos, value):
    row = board[next_pos[0]]
    col = [row[next_pos[1]] for row in board]
    # check for other duplicates --- nvm
    # 


def solve(board):
    next_pos = find_next(board)
    if (not next_pos):
        return True
    
    original_value = board[next_pos[0]][next_pos[1]]
    for value in range(1, 9 + 1):
        if (valid(board, next_pos, value)):
            board[next_pos[0]][next_pos[1]] = value
            if (solve(board)):
                return True
            board[next_pos[0]][next_pos[1]] = original_value
    return False




T = int(input())
results = []
for case in range(T):
    board = []
    for i in range(9):
        row = [int(i) for i in input()]
        board.append(row)
    #solve(board)
    pos = [[i, i // 3 + i % 3 * 3] for i in range(9)]
    #nums = [board[p[0]][p[1]] for p in pos]
    for p in pos:
        board[p[0]][p[1]] = board[p[0]][p[1]] % 9 + 1
    results.append(board)

for result in results:
    for row in result:
        print (''.join([str(i) for i in row]))