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

public class Main {

    static ArrayList<Integer>[] gr;
    static boolean[] was;
    static boolean[] want_h;
    static int to;
    static boolean ans;

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
//        br = new BufferedReader(new FileReader(new File("input.txt")));
//        out = new PrintWriter(new File("output.txt"));
        int PUTEN = nextInt();
        for (int PUTIN_POMOGI = 0; PUTIN_POMOGI < PUTEN; PUTIN_POMOGI++) {
            int[][] a = new int[9][9];
            int[] b = new int[9];
            int[] c = new int[9];
            int n = 9;
            for (int i = 0; i < 9; i++) {
                char[] p = next().toCharArray();
                for (int j = 0; j < 9; j++) {
                    a[i][j] = p[j] - '0';
                }
            }
            b[0] = a[0][0];
            c[0] = a[0][0];
            b[1] = a[1][8];
            c[1] = a[1][8];
            b[2] = a[2][5];
            c[2] = a[2][5];
            b[3] = a[3][6];
            c[3] = a[3][6];
            b[4] = a[4][2];
            c[4] = a[4][2];
            b[5] = a[5][4];
            c[5] = a[5][4];
            b[6] = a[6][3];
            c[6] = a[6][3];
            b[7] = a[7][1];
            c[7] = a[7][1];
            b[8] = a[8][7];
            c[8] = a[8][7];
            for (int i = 0; i < n; i++) {
                c[i] -= 1;
                if (c[i] == 0) c[i] = 9;
            }
            a[0][0] = c[0];
            a[1][8] = c[1];
            a[2][5] = c[2];
            a[3][6] = c[3];
            a[4][2] = c[4];
            a[5][4] = c[5];
            a[6][3] = c[6];
            a[7][1] = c[7];
            a[8][7] = c[8];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    out.print(a[i][j]);
                }
                out.println();
            }

        }
        out.close();
    }


    static BufferedReader br;
    static PrintWriter out;
    static StringTokenizer in = new StringTokenizer("");

    static String next() throws IOException {
        while (!in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }
        return in.nextToken();
    }

    static int[] mix(int[] a) {
        Random rnd = new Random();
        for (int i = 1; i < a.length; i++) {
            int j = rnd.nextInt(i);
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
        }
        return a;
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static Double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }

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

    static class sort implements Comparator<point> {

        @Override
        public int compare(point o1, point o2) {
            return Integer.compare(o1.ind, o2.ind);
        }

    }

    static void dfs(int from, String want) {
        if (ans) return;
        was[from] = true;
        if (want_h[from] && want.equals("H")) ans = true;
        if (!want_h[from] && want.equals("G")) ans = true;
        for (int p : gr[from]) {
            if (!was[p]) dfs(p, want);
        }
        return;
    }

}

class point {
    int ind;
    int wight;
    int speed;

    public point(int ind, int wight, int speed) {
        this.ind = ind;
        this.wight = wight;
        this.speed = speed;
    }
}

//        915346876
//        624812539
//        183925764
//        457631928
//        296478153
//        579783416
//        822154397
//        341769275
//        641738592
//        872915349


//        915346872
//        624817539
//        183925764
//        457631928
//        296478153
//        579283416
//        862154397
//        341769285
//        641738592
//        872915346