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:
import sys

readLine = lambda : sys.stdin.readline()
readInt = lambda : int(sys.stdin.readline())
readInts = lambda : [int(x) for x in sys.stdin.readline().split(" ")]

# Idea: Change the diagonal to +1. This will work unless
# one of the diagonal cells are all 1 away from each other.
# in that case, add 2 to each cell and so on
def main():
    solns = []
    offsets = range(1,9)
    t = readInt()
    for _ in range(t):
        sudoku = []
        for i in range(9):
            sudoku.append([int(x) for x in readLine().rstrip()])
        # need to change one element for each cube
        coords = [(0, 0), (1, 4), (2, 8), (3, 1), (4, 5), (5, 6), (6, 2), (7, 3), (8, 7)]
        for cell in coords:
            row, col = cell
            n = sudoku[row][col]
            n = (n + 9) % 9 + 1
            sudoku[row][col] = n
        s = []
        for row in sudoku:
            s.append("".join(str(x) for x in row))
        solns.append("\n".join(s))
    print("\n".join(solns))

main()