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:
from sys import stdin, stdout
import math,sys
from itertools import permutations, combinations
from collections import defaultdict,deque,OrderedDict
import bisect as bi
'''
#------------------PYPY FAst I/o--------------------------------#

def I():return (int(stdin.readline()))
def In():return(map(int,stdin.readline().split()))
'''
#------------------Sublime--------------------------------------#

#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
def I():return (int(input()))
def In():return(map(int,input().split()))

def find_gt(a, x):
    #'Find leftmost value greater than x'
    i = bi.bisect_right(a, x)
    if i != len(a):
        return i
    else:
        return -1


def main():
    try:
        for _ in range(I()):
            l=[]
            for i in range(9):
                l.append(list(map(int,list(input()))))
            if l[0][0]==1:
                l[0][0]=2
            else:
                l[0][0]-=1

            if l[1][3]==1:
                l[1][3]=2
            else:
                l[1][3]-=1

            if l[2][6]==1:
                l[2][6]=2
            else:
                l[2][6]-=1

            if l[3][1]==1:
                l[3][1]=2
            else:
                l[3][1]-=1

            if l[4][4]==1:
                l[4][4]=2
            else:
                l[4][4]-=1

            if l[5][7]==1:
                l[5][7]=2
            else:
                l[5][7]-=1

            if l[6][2]==1:
                l[6][2]=2
            else:
                l[6][2]-=1

            if l[7][5]==1:
                l[7][5]=2
            else:
                l[7][5]-=1
            if l[8][8]==1:
                l[8][8]=2
            else:
                l[8][8]-=1
            #print(l)
            for i in range(9):
                for j in range(9):
                    print(l[i][j],end='')
                print()
    except:
        pass
M = 998244353
P = 1000000007

if __name__ == '__main__':
    main()