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.*;
import java.lang.*;
import java.io.*;
 
// (int)
 
public class Codechef  {
	static String f(char ch) {
		
		return Character.toString( (char)(((int)(ch-'0'))%9+1)+'0');
	}
	public static void main (String[] args) throws java.lang.Exception {
		
		Scanner scn = new Scanner(System.in);
		long t = scn.nextLong();
		
		while(t-->0) {
			
			StringBuilder[] a = new StringBuilder[(int)9];
			
 
			for(int i = 0; i < 9; i++) {
				a[i] = new StringBuilder("");
				a[i].append(scn.next());
			}
			
			
			a[0].replace(0, 1, f(a[0].charAt(0)));
			
			a[1].replace(4, 5, f(a[1].charAt(4)));
			a[2].replace(8, 9, f(a[2].charAt(8)));
			a[3].replace(6, 7, f(a[3].charAt(6)));
			a[4].replace(1, 2, f(a[4].charAt(1)));
			a[5].replace(5, 6, f(a[5].charAt(5)));
			a[6].replace(3, 4, f(a[6].charAt(3)));
			a[7].replace(7, 8, f(a[7].charAt(7)));
			a[8].replace(2, 3, f(a[8].charAt(2)));
				
			
			for(int i = 0; i < 9; i++) {
				System.out.println(a[i]);
			}
			
			
			
		}
	}
}








//import java.util.*;
//import java.lang.*;
//import java.io.*;
// 
//// (int)
// 
//public class Codechef  {	
//	public static void main (String[] args) throws java.lang.Exception {
//		
//		Scanner scn = new Scanner(System.in);
//		long t = scn.nextLong();
//		
//		while(t-->0) {
//			long n = scn.nextLong();
////			long a = scn.nextLong();
////			long b = scn.nextLong();
//		
//			
//			
//			
//			long[] a = new long[(int)n];
//			for(int i = 0; i < n; i++) {
//				a[i] = scn.nextLong();
//			}
//			
//			if(n == 1) {
//				System.out.println(0);
//				continue;
//			}
//			if(n == 2) {
//				System.out.println(1);
//				continue;
//			}
//			
//			Arrays.sort(a);
//			
//			long d = 1;
//			long s = 1;
////			ArrayList<Long> v = new ArrayList<Long>();
//			
//			long max = -1;
//			
//			for(int i = 0; i < n-1; i++) {
//				
//				if(a[i]==a[i+1]) {
//					s++;
//				} else {
//					max = Math.max(max, s);
////					v.add(s);
//					s = 1;
//					d++;
//				}
//				
//			}
//			
//			max = Math.max(max, s);
//			
//			
//			if(max < d) {
//				System.out.println(max);
//			}
//			else if(max == d){
//				System.out.println(d-1);
//			} 
//			else {
//				System.out.println(d);
//			}
//			
//			
//			
//			
//			
//			
//		}
//	}
//}