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.util.*;
import java.io.*;



public class Main{
    static long m=998244353l;                   //line 156 modInverse
    static boolean[] vis;                       //line 74 and 91 hasElement ans pth_fnd
    public static void main(String[] args) throws IOException{
        // long sttm=System.currentTimeMillis();
        int MAX=1000000007;
        FastReader sc=new FastReader();
        OutputStream out=new BufferedOutputStream(System.out);
        int t=sc.nextInt();
        while(t-->0){
            int[][] sdk=new int[9][9];
            for(int i=0;i<9;i++){
                String s=sc.next();
                for(int j=0;j<9;j++){
                    sdk[i][j]=s.charAt(j)-'0';
                }
            }
            sdk[0][0]=(sdk[0][0]%9)+1;
            sdk[3][1]=(sdk[3][1]%9)+1;
            sdk[6][2]=(sdk[6][2]%9)+1;
            sdk[1][3]=(sdk[1][3]%9)+1;
            sdk[4][4]=(sdk[4][4]%9)+1;
            sdk[7][5]=(sdk[7][5]%9)+1;
            sdk[2][6]=(sdk[2][6]%9)+1;
            sdk[5][7]=(sdk[5][7]%9)+1;
            sdk[8][8]=(sdk[8][8]%9)+1;
            for(int i=0;i<9;i++){
                for(int j=0;j<9;j++){
                    out.write((sdk[i][j]+"").getBytes());
                }
                out.write('\n');
            }

        }
        out.flush();

        // long sttm=System.currentTimeMillis();
       
    }


    public static long cnt_sum_k_subar(long[] a,int n,int k){
        HashMap<Long,Long> map=new HashMap<Long,Long>();
        long ret=0;
        long cur_sum=0;
        for(int i=0;i<n;i++){
            cur_sum+=a[i];
            if(cur_sum==k){
                ret++;
            }
            if(map.containsKey(cur_sum-k)){
                ret+=map.get(cur_sum-k);
            }
            if(map.containsKey(cur_sum)){
                map.put(cur_sum, map.get(cur_sum)+1);
            }
            else{
                map.put(cur_sum, (long)1);
            }
        }
        return ret;
    }



    public static ArrayList<Integer> lcm(int num){
        ArrayList<Integer> arrl=new ArrayList<Integer>();
        while(num%2==0){
            arrl.add(2);
            num/=2;
        }
        for(int i=3;i*i<=num;i+=2){
            while(num%i==0){
                arrl.add(i);
                num/=i;
            }
        }
        if(num>2){
            arrl.add(num);
        }
        return arrl;
    }


    static long modInverse(long a,long m) 
    { 
        long m0 = m; 
        long y = 0l, x = 1l; 
  
        if (m == 1) 
            return 0l; 
  
        while (a > 1) 
        { 
  
            long q = a / m; 
  
            long t = m; 
  
            m = a % m; 
            a = t; 
            t = y; 
  
            y = x - q * y; 
            x = t; 
        } 
        if (x < 0) 
            x += m0; 
  
        return x; 
    } 


    public static TreeSet<Long> arr_fact(long num){
        TreeSet<Long> arr=new TreeSet<Long>();
        int cnt=0;
        for(long i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                    arr.add(i);
                }
                else{
                    arr.add(i);arr.add(num/i);
                    cnt+=2;
                }
            }
        }
        return arr;
    }



    public static int num_fact(int num){
        ArrayList<Integer> arr=new ArrayList<Integer>();
        int cnt=0;
        for(int i=1;i*i<=num;i++){
            if(num%i==0){
                if(i*i==num){
                    cnt+=1;
                }
                else{
                    cnt+=2;
                }
            }
        }
        return cnt;
    }


    public static long cal(int k,int x){
        long val=1;

        for(int i=0;i<k;i++){
            val*=2;
            if(val>x){
                break;
            }
        }
        return val;
    }

    public static void sort_inc(int[][] arr,int col){        //change dimention if req
        Arrays.sort(arr, new Comparator<int[]>() {
            public int compare(final int[] entry1,final int[] entry2) { 
                if (entry1[col] > entry2[col]) 
                    return 1; 
                else
                    return -1; 
            }
        });
    }


    public static boolean prime(int n){
        for(int i=2;i*i<=n;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }


    static int gcd(int a, int b) 
	{ 
	if (b == 0) 
		return a; 
	return gcd(b, a % b); 
	} 
}


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; 
    }
}