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

import java.util.*;
import java.util.Map.Entry;


public class  Anti_Sudoku     
{ 
    
    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; 
        } 
    } 
    public static long changeme(long b,int i,int fin,long num)
    {
        return ((b>>i)|(b<<(fin-i)))&num;
    }
    static long power(long x, long y, long m)  
    { 
        if (y == 0) 
            return 1; 
          
        long p = power(x, y / 2, m) % m; 
        p = (p * p) % m; 
      
        if (y % 2 == 0) 
            return p%m; 
        else
            return (x * p) % m; 
    } 
    static long modInverse(long a,long m) 
    { 
        return power(a, m - 2, m);  
    } 
    static long gcd(long a,long b)  
    { 
        if (a == 0) 
            return b; 
        return gcd(b % a, a); 
    } 
    static int kFactors(long n,long k) 
    { 
        ArrayList<Long> P = new ArrayList<Long>(); 
      
        // Insert all 2's in list 
        while (n % 2 == 0) 
        { 
            P.add(2l); 
            n /= 2; 
        } 
        for (int i = 3; i * i <= n; i = i + 2) 
        { 
            while (n % i == 0) 
            { 
                n = n / i; 
                P.add((long)i); 
            } 
        } 
        if (n > 2) 
            P.add(n); 
        if (P.size() < k) 
        {  
            return 0; 
        } 
        else
        {
            return 1;
        }
    } 
    public static void main(String[] args) 
    { 
        FastReader sc=new FastReader(); 
        PrintWriter pw=new PrintWriter(System.out);
        
        int t=sc.nextInt();

        m:while(t-->0)
        {
            char arr[][]=new char[9][9];

            for(int i=0;i<9;i++)
            {
                arr[i]=sc.nextLine().toCharArray();
            }

            arr[0][0]=(char)((((arr[0][0]%48)+1)%10)+48);
            if(arr[0][0]==48)
            {
                arr[0][0]=(char)(49);
            }

            arr[1][3]=(char)((((arr[1][3]%48)+1)%10)+48);
            if(arr[1][3]==48)
            {
                arr[1][3]=(char)(49);
            }

            arr[2][6]=(char)((((arr[2][6]%48)+1)%10)+48);
            if(arr[2][6]==48)
            {
                arr[2][6]=(char)(49);
            }

            arr[3][1]=(char)((((arr[3][1]%48)+1)%10)+48);
            if(arr[3][1]==48)
            {
                arr[3][1]=(char)(49);
            }

            arr[4][4]=(char)((((arr[4][4]%48)+1)%10)+48);
            if(arr[4][4]==48)
            {
                arr[4][4]=(char)(49);
            }

            arr[5][7]=(char)((((arr[5][7]%48)+1)%10)+48);
            if(arr[5][7]==48)
            {
                arr[5][7]=(char)(49);
            }

            arr[6][2]=(char)((((arr[6][2]%48)+1)%10)+48);
            if(arr[6][2]==48)
            {
                arr[6][2]=(char)(49);
            }

            arr[7][5]=(char)((((arr[7][5]%48)+1)%10)+48);
            if(arr[7][5]==48)
            {
                arr[7][5]=(char)(49);
            }

            arr[8][8]=(char)((((arr[8][8]%48)+1)%10)+48);
            if(arr[8][8]==48)
            {
                arr[8][8]=(char)(49);
            }

           
            //System.out.println();
            for(int i=0;i<9;i++)
                pw.println(arr[i]);
            
           
        }
        pw.flush();

        
    }

}