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 JAVA):

Solution:
import java.util.*;
public class D10
{
	public static void main(String[] args)
	{
	Scanner s=new Scanner(System.in);
	int t=s.nextInt();
	while(t>0)
	{
	StringBuilder a[]=new StringBuilder[9];
	
	for(int i=0;i<9;i++)
	{
	a[i]=new StringBuilder("");
	String str=s.next();
	a[i].append(str);
	}
	
	if(a[0].charAt(0)=='1'){ a[0].setCharAt(0,'2');}
	
	else {a[0].setCharAt(0,'1');}
	
	if(a[1].charAt(3)=='1') {a[1].setCharAt(3,'2');}
	
	else {a[1].setCharAt(3,'1');}
	
	if(a[2].charAt(6)=='1') {a[2].setCharAt(6,'2');}
	
	else {a[2].setCharAt(6,'1');}

	if(a[3].charAt(1)=='1') {a[3].setCharAt(1,'2');}
	
	else {a[3].setCharAt(1,'1');}

	if(a[4].charAt(4)=='1') {a[4].setCharAt(4,'2');}
	
	else {a[4].setCharAt(4,'1');}
	
	if(a[5].charAt(7)=='1') {a[5].setCharAt(7,'2');}
	
	else {a[5].setCharAt(7,'1');}
	
	if(a[6].charAt(2)=='1') {a[6].setCharAt(2,'2');}
	
	else {a[6].setCharAt(2,'1');}

	if(a[7].charAt(5)=='1') {a[7].setCharAt(5,'2');}
	
	else {a[7].setCharAt(5,'1');}
	
	if(a[8].charAt(8)=='1') {a[8].setCharAt(8,'2');}
	
	else {a[8].setCharAt(8,'1');}
	
	for(int i=0;i<9;i++)
	{
	 System.out.println(a[i].toString());
	}
	
	t--;
	}
	}
}