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 solve(sudoku):

	x, y = 0, 0
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1
	x, y = 1, 4
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1
	x, y = 2, 8
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1

	x, y = 3, 1
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1
	x, y = 4, 5
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1
	x, y = 5, 6
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1

	x, y = 6, 2
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1
	x, y = 7, 3
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1
	x, y = 8, 7
	sudoku[x][y] = 1 if sudoku[x][y] == 9 else sudoku[x][y] + 1

	for row in range(9):
		for col in range(9):
			print(sudoku[row][col], end="")
		print()

	# return 0


numTestCase = int(input())
for t in range(numTestCase):
	sudoku = []
	for i in range(9):
		row = input()
		rowList = []
		for j in range(9):
			rowList.append(int(row[j]))
		sudoku.append(rowList)

	solve(sudoku)

	# sudoku[0][0] = 3
	# print(sudoku[0][0])
	# print(sudoku[1][4])
	# print(sudoku[2][8])










# 254 873 296
# 316 592 714
# 721 641 835

# 863 125 149
# 975 324 628
# 412 961 357

# 631 457 182
# 598 236 411
# 247 189 561
# ==============
# 154 873 296
# 386 592 714
# 729 641 835

# 863 725 149
# 975 314 628
# 412 968 357

# 631 457 982
# 598 236 471
# 247 189 563
# ==============
# 154 873 396
# 336 592 714
# 729 645 835

# 863 725 145
# 979 314 628
# 412 958 357

# 631 457 992
# 998 236 471
# 247 789 563