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.io.*;
public class TestClass{
	static char[][] map;
	static void solve(int i,int j)
	{
		StringBuilder sb = new StringBuilder();
		int num=0;
		if(map[i][j]=='5')
			map[i][j]='4';
		else
		{
			num = Integer.parseInt(map[i][j]+"");
			num = 10-num;
			sb.append(num+"");
			map[i][j] = sb.toString().charAt(0);
			sb = new StringBuilder();
		}
	}
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		sc.nextLine();
		while(t-->0)
		{
			int i=0,j=0;
			map = new char[9][];
			for(i=0;i<9;i++)
			{
				map[i] = sc.nextLine().toCharArray();
			}
			i =0;
			j=0;
			solve(0,0);
			solve(1,3);
			solve(2,6);
			solve(3,1);
			solve(4,4);
			solve(5,7);
			solve(6,2);
			solve(7,5);
			solve(8,8);
			for(i=0;i<9;i++)
				System.out.println(new String(map[i]));
		}
	}
}