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 sys
from math import sqrt, floor, ceil
# from bisect import bisect
from collections import deque, Counter
inp = sys.stdin.readline
read = lambda: list(map(int, inp().split()))



def a():
	ans = ""
	for _ in range(int(inp())):
		n = int(inp())
		res = abs((n-1) - ceil(n/2) + (n%2))
		ans += str(res)+"\n"
	print(ans)

def b():
	ans = ""; alph = "abcdefghijklmnopqrstuvwxyz"
	for _ in range(int(inp())):
		n, a, b = read();
		seq = alph[:b]+ alph[:b]*((a-b)//b) + alph[:b][:(a-b)%b]
		res = seq*(n//a) + seq[:n%a]
		ans += res+"\n"
	print(ans)



def c():
	ans = ""
	for _ in range(int(inp())):
		n = int(inp()); arr = read(); uniq = len(set(arr))
		c = Counter(arr)
		mi = min(uniq, c.most_common()[0][1]) - (uniq == c.most_common()[0][1])
		ans += str(mi)+"\n"
	print(ans)

def d():
	ans = ""
	for _ in range(int(inp())):
		sud = []; sett =set()
		for i in range(9):
			sud.append(list(inp().strip()))
		lis = [[0, 0], [1, 3], [2, 6], [3, 1], [4, 4], [5, 7], [6, 2], [7, 5], [8, 8]]
		for i in lis:
			x, y = i
			p = sud[x][y]
			sud[x][y] = str(9 - int(p) if p != "9" else 1)
		for i in sud:
			print(("").join(i))
		


if __name__ == "__main__":
	# a()
	# b()
	# c()
	d()