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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;
import java.util.ArrayList;
import java.util.Vector;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.ArrayDeque;
import java.io.InputStream;
 
public class Z_D {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Autocompletion solver = new Autocompletion();
        solver.solve(1, in, out);
        out.close();
    }
 
    static class Autocompletion {
        
        public void solve(int testNumber, InputReader in, PrintWriter out) {
        	int t=in.nextInt();
        	for(int z=0;z<t;z++) {
        		int[][]arr=new int[9][9];
        		for(int i=0;i<9;i++) {
        			String s=in.next();
        			for(int j=0;j<9;j++) {
        				arr[i][j]=Character.getNumericValue(s.charAt(j));
        			}
        		}
        		for(int i=0;i<3;i++) {
        			for(int j=0;j<3;j++) {
        				int vert=i+j*3;
        				int hor=3*i+j;
        				ArrayList<Integer> possible=new ArrayList<Integer>();
        				for(int a=0;a<3;a++) {
        					for(int b=0;b<3;b++) {
        						if(a!=i && b!=j) {
        							possible.add(arr[3*i+b][3*j+a]);
        							break;
        						}
        					}
        				}
//        				System.out.println(hor+" "+vert+" "+arr[hor][vert]+" "+possible.get(0));
        				arr[hor][vert]=possible.get(0);
        			}
        		}
        		for(int i=0;i<9;i++) {
        			for(int j=0;j<9;j++) {
        				out.print(arr[i][j]);
        			}
        			out.println();
        		}
        	}
        }
        
    }
    
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
 
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
 
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int nextInt() {
            return Integer.parseInt(next());
        }
 
    }
}