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:
//package MyPackage;
import java.io.*;
import java.util.*;
import java.text.*;
public class MyClass {
    final static long mod = 1_000_000_007;
    final static int mini = Integer.MIN_VALUE;
    final static int maxi = Integer.MAX_VALUE;
    static long gcd(long a, long b) {
        if (b == 0) return a;
        return gcd(b, a % b);
    }
    static long power(long a, long b) {
        long res = 1;
        while(b-- > 0) res = (res % mod * a % mod) % mod;
        return res;
    }
    static long ncr(long n, long r) {
        if (r > n - r) r = n - r;
        long[] C = new long[(int) r + 1];
        C[0] = 1;
        for (int i = 1; i <= n; i++) {
            for (long j = Math.min(i, r); j > 0; j--)
                C[(int) j] = (C[(int) j] + C[(int) j - 1]) % mod;
        }
        return C[(int) r];
    }
    static boolean isPrime(int n) {
        if (n <= 1)
            return false;
        else if (n == 2)
            return true;
        else if (n % 2 == 0)
            return false;
        for (int i = 3; i <= Math.sqrt(n); i += 2) {
            if (n % i == 0)
                return false;
        }
        return true;
    }
    static int countSetBits(int n) {
        int count = 0;
        while(n > 0) {
            n &= (n - 1);
            count++;
        }
        return count;
    }
    static int digits(long n) {
        int count = 0;
        long temp = n;
        while (temp > 0) {
            temp /= 10;
            count++;
        }
        return count;
    }
    static boolean isPalindrome(long i) {
        long originalNum = i;
        long remainder;
        long reversedNum = 0;
        while (i != 0) {
            remainder = i % 10;
            reversedNum = reversedNum * 10 + remainder;
            i /= 10;
        }
        return originalNum == reversedNum;
    }
    static long lcm(long a, long b) {
        return (a / gcd(a, b)) * b;
    }
    static void sort(long[] a) {
        ArrayList<Long> l = new ArrayList<>();
        for (long value : a) {
            l.add(value);
        }
        Collections.sort(l);
        for (int i = 0; i < l.size(); i++)
            a[i] = l.get(i);
    }
    static void sort(int[] a) {
        ArrayList<Integer> l = new ArrayList<>();
        for (int value : a) {
            l.add(value);
        }
        Collections.sort(l);
        for (int i = 0; i < l.size(); i++)
            a[i] = l.get(i);
    }
    static void reverse(int[] arr) {
        int l = 0;
        int h = arr.length - 1;
        while (l < h) {
            swap(arr, l, h);
            l++;
            h--;
        }
    }
    static String reverse(String s) {
        StringBuilder res = new StringBuilder(s);
        return res.reverse().toString();
    }
    static long fact(long n) {
        long res = 1, i;
        for (i = 2; i <= n; i++)
            res *= i;
        return res;
    }
    static void swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String n() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nint() {
            return Integer.parseInt(n());
        }

        long nlong() {
            return Long.parseLong(n());
        }

        double ndouble() {
            return Double.parseDouble(n());
        }

        int[] narr(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nint();
            return a;
        }

        int[][] narr(int n, int m) {
            int[][] a = new int[n][m];
            for (int i = 0; i < n; i++)
                for (int j = 0; j < m; j++)
                    a[i][j] = nint();
            return a;
        }

        String nline() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static class Pair {
        int a;
        int b;

        public Pair(int a, int b) {
            this.a = a;
            this.b = b;
        }
    }
    public static void main(String[] args) {
        FastReader sc = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        int t = sc.nint();
        while(t-- > 0) {
            int n = 9;
            int[][] arr = new int[n][n];
            for(int i = 0; i < n; i++) {
                String s = sc.n();
                for(int j = 0; j < n; j++) {
                    arr[i][j] = s.charAt(j) - '0';
                }
            }
            for(int i = 0; i < n; i++) {
                for(int j = 0; j < n; j++) {
                    out.print(arr[i][j] == 1 ? 2 : arr[i][j]);
                }
                out.println();
            }
        }
        out.flush();
        out.close();
    }

}