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.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;

 
 
public class C{
	
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    }
	
	static class Pair
	{
		long o;
		long z;
		Pair(long o,long z)
		{
			this.o = o;
			this.z = z;
		}
	}
	
	static class Node
	{
		Node l;
		Node r;
		char ch;
		Node(char ch)
		{	
			this.ch = ch;
		}
	}
	static int gcd(int a,int b)
	{
		if(a == 0) return b;
		if(b == 0) return a;
		
		return gcd(b,a%b);
	}
	static long gcd(long a,long b)
	{
		if(a == 0) return b;
		if(b == 0) return a;
		
		return gcd(b,a%b);
	}
	static void preCompute(long fact[])
	{
		fact[0] = 1;
		for(int i = 1; i < fact.length; i++)
		{
			fact[i] = i*fact[i-1]%rem;
		}
	}
	static long power(long x, long y, long p) 
    { 
        long res = 1; 
        x = x % p; 
                      
        while (y > 0) 
        {
            if (y % 2 == 1) 
                res = (res * x) % p; 
 
            y = y >> 1; 
            x = (x * x) % p; 
        }
        return res; 
    } 
	static long modInverse(long n, long p) 
    { 
        return power(n, p-2, p); 
    }
	
	static long nCrModPFermat(int n, int r, long p) 
	{ 
 
		if (r == 0) 
			return 1; 
 
		return (fact[n]* modInverse(fact[r], p) % p * modInverse(fact[n-r], p) % p) % p; 
	}
	static long rem = 998244353L;
	static long fact[];
	
	static ArrayList<Integer> ar = new ArrayList<>();
	static void sieve(int n)
	{	
		//System.out.println(n);
		boolean prime[] = new boolean[n+1];
		for(int i=0;i<= n;i++) 
			prime[i] = true; 
      
		for(int p = 2; p*p <=n; p++) 
		{	 
        
			if(prime[p] == true) 
			{ 	
				for(int i = p*p; i <= n; i += p) 
					prime[i] = false; 
			} 
		} 
		
		for(int i = 2; i <= n; i++)
		{
			if(prime[i]) ar.add(i);
		}
	}
	
	
	static long mod = (long)(1e9)+7;
	public static void main(String[] args) 
	{
		OutputStream outputStream = System.out;
		FastReader sc = new FastReader();
        PrintWriter out = new PrintWriter(outputStream);
        
        int t = sc.nextInt();
        
        while(t-- > 0)
        {
        	int mat[][] = new int[10][10];
        	
        	for(int i = 1; i < 10; i++)
        	{	
        		String s = sc.nextLine();
        		for(int j = 1; j < 10; j++)
        		{
        			mat[i][j] = s.charAt(j-1)-'0';
        		}
        	}
        	
        	
        	mat[1][1] -= 1;
        	mat[2][4] -= 1;
        	mat[3][7] -= 1;
        	mat[4][2] -= 1;
        	mat[5][5] -= 1;
        	mat[6][8] -= 1;
        	mat[7][3] -= 1;
        	mat[8][6] -= 1;
        	mat[9][9] -= 1;
        	
        	for(int i = 1; i < 10; i++)
        	{
        		for(int j = 1; j < 10; j++)
        		{
        			if(mat[i][j] == 0)
        			{
        				out.print(9);
        			}
        			else out.print(mat[i][j]);
        		}
        		out.println();
        	}
        	
        }
        out.close();
	}
 
}