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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class D {

	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(in.readLine());
		int[][] sudoku;
		int t = Integer.parseInt(st.nextToken());
		for (int i = 0; i < t; i++)
		{
			sudoku = new int[9][9];
			for (int k = 0; k < 9; k++)
			{
				st = new StringTokenizer(in.readLine());
				char[] arr = st.nextToken().toCharArray();
				for (int j = 0; j < 9; j++)
				{
					sudoku[k][j] = arr[j] - '1';
				}
				
			}
			sudoku[0][0]++;
			sudoku[0][0]%=9;
			sudoku[3][1]++;
			sudoku[3][1]%=9;
			sudoku[6][2]++;
			sudoku[6][2]%=9;
			sudoku[1][3]++;
			sudoku[1][3]%=9;
			sudoku[4][4]++;
			sudoku[4][4]%=9;
			sudoku[7][5]++;
			sudoku[7][5]%=9;
			sudoku[2][6]++;
			sudoku[2][6]%=9;
			sudoku[5][7]++;
			sudoku[5][7]%=9;
			sudoku[8][8]++;
			sudoku[8][8]%=9;
			
			for (int j = 0; j < 9; j++)
			{
				String ans = "";
				for (int k = 0; k < 9; k++)
				{
					ans += sudoku[j][k] + 1;
				}
				System.out.println(ans);
			}
		}
		
	}

}