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 io, os
# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
import sys
input=sys.stdin.readline
MOD = 1000000007
MOD2 = 998244353
ii = lambda: int(input().strip('\n'))
si = lambda: input().strip('\n') 
dgl = lambda: list(map(int,input().strip('\n')))
f = lambda: map(int, input().strip('\n').split())
il = lambda: list(map(int, input().strip('\n').split()))
ls = lambda: list(input().strip('\n'))
let = 'abcdefghijklmnopqrstuvwxyz'
# n,r=f()
# l=il()
# ans=[r]
# for i in range(1,n):
#     mx,r=-1,-1
#     for j in range(i):
#         if l[j]-l[i]<=(2*r) and ans[j]>mx:
#             mx=ans[j]
#             r=l[i]
for _ in range(ii()):
    sud=[]
    for i in range(9):
        s=ls()
        sud.append(s)
    sud[1][3] = '1' if sud[1][3] != '1' else '2'
    sud[0][0] = '1' if sud[0][0] != '1' else '2'
    sud[2][6] = '1' if sud[2][6] != '1' else '2'
    sud[3][1] = '1' if sud[3][1] != '1' else '2'
    sud[4][4] = '1' if sud[4][4] != '1' else '2'
    sud[5][7] = '1' if sud[5][7] != '1' else '2'
    sud[6][2] = '1' if sud[6][2] != '1' else '2'
    sud[7][5] = '1' if sud[7][5] != '1' else '2'
    sud[8][8] = '1' if sud[8][8] != '1' else '2'
    for i in sud:
        print(''.join(i))