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, exit
from collections import Counter
input = stdin.readline

def i(): return input()
def ii(): return int(input())
def iis(): return map(int, input().split())
def liis():	return list(map(int, input().split()))
def print_array(a): print("".join(map(str, a)))


def get_set_column(sudoku, col):
	cs = set()
	for i in range(len(sudoku)):
		if i == col: continue
		cs.add(sudoku[i][col])
	return cs

def get_set_square(sudoku, pos):
	ss = set()
	i = pos-(pos%3)
	for j in range(i, i+3):
		for k in range(i, i+3):
			if j == k:
				continue
			ss.add(sudoku[j][k])
	return ss


def get_number(sl, sc, ss):
	for i in ss:
		if i in sc:
			if i in sl:
				return i

t = ii()
for _ in range(t):
	sudoku = []
	for i in range(9):
		line = input()
		linea = [c for c in line.strip()]
		sudoku.append(linea)
	
	j = 0
	for i in range(len(sudoku)):
		set_line = set(sudoku[j])
		set_line.discard(sudoku[j][i])
		set_column = get_set_column(sudoku, i)
		set_square = get_set_square(sudoku, i)
		found = get_number(set_line, set_column, set_square)
		sudoku[j][i] = found
		j += 3
		if j > 8:
			j = (j%9)+1
	
	for i in sudoku:
		print_array(i)