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 distribution(n):
    return (n-1)//2

def problem_A():
    print(distribution(int(input())))

s = 'abcdefghijklmnopqrstuvwxyz'
def cons_str(n,b):
    a = s[:b]
    ans = ''
    while n > b:
        ans += a
        n -= b
    ans += a[:n]
    return ans

def problem_B():
    n,a,b = list(map(int,input().split()))
    print(cons_str(n,b))

def comp_teams(a):
    if len(a) < 2:
        return 0
    s = len(set(a))
    if s == len(a):
        return 1
    a.sort()
    t = 0
    temp = 1
    for i in range(1,len(a)):
        if a[i] == a[i-1]:
            temp += 1
        else:
            if t < temp:
                t = temp
            temp = 1
    if t < temp:
        t = temp
    
    if s <= t - 1:
        return s
    if s == t:
        return s - 1
    else:
        return t

def problem_C():
    l = int(input())
    a = list(map(int,input().split()))
    print(comp_teams(a))

def antisudoku(a):
    for i in range(9):
        for j in range(9):
            if a[i][j] == '2':
                a[i][j] = '1'
    return a

def problem_D():
    a = []
    for _ in range(9):
        a.append(list(input()))
    b = antisudoku(a)
    for i in range(9):
        print(''.join(b[i]))

def three_block_palindrome(s):
    a = []
    b = []
    c = []
    l = len(s)
    for _ in range(l):
        a = []
        for _ in range(l+1):
            a.append([0]*26)
    l += 1
    for i in range(1,l):
        k = s[i-1] - 1 
        for j in range(26):
            a[i][j] = a[i-1][j]
        a[i][k] += 1
    maxlength = 0
    for i in range(l):
        for j in range(i,l):
            maxa = 0
            maxb = 0
            for k in range(26):
                if a[l-1][k]-a[j][k] > a[i][k]:
                    if maxa < a[i][k]:
                        maxa = a[i][k]
                else:
                    if maxa < a[l-1][k]-a[j][k]:
                        maxa = a[l-1][k]-a[j][k]
                    
                if maxb < a[j][k] - a[i][k]:
                        maxb = a[j][k] - a[i][k]
            if maxlength < 2*maxa + maxb:
                maxlength = 2*maxa + maxb

    return maxlength
                
def problem_E1():
    l = int(input())
    s = list(map(int,input().split()))
    print(three_block_palindrome(s))

cases = int(input())
for _ in range(cases):
    # problem_A()
    # problem_B()
    # problem_C()
    problem_D()
    # problem_E1()