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

public class D {

    void solve() throws Exception {
        char[][] b = new char[9][9];
        for (int i = 0; i < 9; i++) {
            String s = ns();
            for (int j = 0; j < 9; j++) {
                b[i][j] = s.charAt(j);
            }
        }
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                if (i == 0 && j == 0
                        || i == 1 && j == 4
                        || i == 2 && j == 8
                        || i == 3 && j == 1
                        || i == 4 && j == 5
                        || i == 5 && j == 6
                        || i == 6 && j == 2
                        || i == 7 && j == 3
                        || i == 8 && j == 7) {
                    out.print(b[(i + 1) % 9][j]);
                } else {
                    out.print(b[i][j]);
                }
            }
            out.println();
        }
    }

    void run() throws Exception {
        initIO();
        int t = ni();
        while (t-- > 0) {
            solve();
            out.flush();
        }
    }

    public static void main(String[] args) throws Exception {
        new D().run();
    }

    /**
     * IO.
     */

    PrintWriter out;
    BufferedReader br;
    StringTokenizer tokenizer;

    void initIO() {
        out = new PrintWriter(System.out);
        br = new BufferedReader(new InputStreamReader(System.in));
        tokenizer = null;
    }

    int ni() throws Exception {
        return Integer.parseInt(ns());
    }

    long nl() throws Exception {
        return Long.parseLong(ns());
    }

    double nd() throws Exception {
        return Double.parseDouble(ns());
    }

    int[] nia(int n) throws Exception {
        int[] x = new int[n];
        for (int i = 0; i < x.length; i++) {
            x[i] = ni();
        }
        return x;
    }

    long[] nla(int n) throws Exception {
        long[] x = new long[n];
        for (int i = 0; i < x.length; i++) {
            x[i] = nl();
        }
        return x;
    }

    double[] nda(int n) throws Exception {
        double[] x = new double[n];
        for (int i = 0; i < x.length; i++) {
            x[i] = nd();
        }
        return x;
    }

    String ns() throws Exception {
        while (tokenizer == null || !tokenizer.hasMoreTokens())
            tokenizer = new StringTokenizer(br.readLine());
        return tokenizer.nextToken();
    }

    String nline() throws Exception {
        tokenizer = null;
        return br.readLine();
    }
}