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:
#!/usr/bin/env python3
import atexit
import io
import sys
from string import printable

_I_B = sys.stdin.read().splitlines()
input = iter(_I_B).__next__
_O_B = io.StringIO()
sys.stdout = _O_B

@atexit.register
def write():
    sys.__stdout__.write(_O_B.getvalue())

def which_block(i,j):
    return ((i//3)*3) + (j//3)

def baseconvert(n, base):
    digits = printable[:-6]
    s = ""
    while 1:
        rm = n % base
        # print(rm)
        s = digits[rm] + s
        n//=base
        if n == 0:
            break
    return s

def main():
    for _ in range(int(input())):
        so=[]
        for i in range(9):
            so.append(list(input().strip()))
        for i in range(3):
            for j in range(3):
                ti=i*3+j
                tj=i+3*j
                so[ti][tj]=str(int(so[ti][tj])%9+1)
                # print(ti,tj)
        for i in so:
            print("".join(i))

if __name__=='__main__':
    main()