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 math import ceil,gcd,floor,log
from collections import deque,defaultdict
from heapq import heappush as hpush,heappop as hpop, heapify
from functools import lru_cache
import sys
# input = sys.stdin.buffer.readline
def inpi(): return(int(input()))
def inpa(): return(list(map(int,input().split())))
def inp(): s = input();return(list(s))
def inpv(): return(map(int,input().split()))

l="abcdefghijklmnopqrstuvwxyz"

testcase=int(input())
for test in range(testcase):
	a=[]
	for i in range(9):
		a.append(inp())

	for i in range(0,9,3):
		if i==0:
			a[1][i]=a[0][i]
		elif i==3:
			a[2][i]=a[1][i]
		else:
			a[0][i]=a[2][i]
	
	for i in range(1,9,3):
		if i==1:
			a[1+3][i]=a[0+3][i]
		elif i==3+1:
			a[2+3][i]=a[1+3][i]
		else:
			a[0+3][i]=a[2+3][i]

	for i in range(2,9,3):
		if i==0+2:
			a[1+6][i]=a[0+6][i]
		elif i==3+2:
			a[2+6][i]=a[1+6][i]
		else:
			a[0+6][i]=a[2+6][i]

	for i in a:
		print(''.join(i))