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.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        OutputStream outp = System.out;
        PrintWriter outt = new PrintWriter(outp);
	    int t = Integer.parseInt(br.readLine());
	    while(t-->0){
	        int[][] a = new int[9][9];
	        String[] b = new String[9];
	        for(int i=0;i<9;i++){
	            b[i] = br.readLine();
            }
	        for(int i=0;i<9;i++){
	            for(int j=0;j<9;j++){
	                a[i][j] = b[i].charAt(j)-'0';
                }
            }
	        int val = a[0][0];
	        if(val==9){
	            a[0][0] = 8;
            }
	        else{
	            a[0][0] = val+1;
            }
            int val1 = a[1][3];
            if(val1==9){
                a[1][3] = 8;
            }
            else{
                a[1][3] = val1+1;
            }
            int val3 = a[2][6];
            if(val3==9){
                a[2][6] = 8;
            }
            else{
                a[2][6] = val3+1;
            }
            int val4 = a[3][1];
            if(val4==9){
                a[3][1] = 8;
            }
            else{
                a[3][1] = val4+1;
            }
            int val5 = a[4][4];
            if(val5==9){
                a[4][4] = 8;
            }
            else{
                a[4][4] = val5+1;
            }
            int val6 = a[5][7];
            if(val6==9){
                a[5][7] = 8;
            }
            else{
                a[5][7] = val6+1;
            }
            int val7 = a[6][2];
            if(val7==9){
                a[6][2] = 8;
            }
            else{
                a[6][2] = val7+1;
            }
            int val8 = a[7][5];
            if(val8==9){
                a[7][5] = 8;
            }
            else{
                a[7][5] = val8+1;
            }
            int val9 = a[8][8];
            if(val9==9){
                a[8][8] = 8;
            }
            else{
                a[8][8] = val9+1;
            }
            for(int i=0;i<9;i++){
                for(int j=0;j<9;j++){
                    outt.print(a[i][j]);
                }
                outt.println();
            }
	    }
        outt.close();
    }
}