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

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        Scanner in = new Main().new Scanner(inputStream);
        Main solver = new Main();
        solver.runn(in);
    }

    public void runn(Scanner in) {
        int t = in.ni();
        while (t-- > 0) {
            int[] sc = { 6, 1, 5, 8, 2, 4, 7, 0, 3 };
            for (int i = 0; i < 9; i++) {
                String line = in.rl();
                char[] chs = line.toCharArray();
                int j = sc[i];
                chs[j] = (char) (chs[j] + 1);
                if (chs[j] == ('9' + 1))
                    chs[j] = '1';
                System.out.println(new String(chs));
            }
        }
    }

    class Scanner {
        BufferedReader br;
        StringTokenizer in;

        public Scanner(InputStream inputStream) {
            br = new BufferedReader(new InputStreamReader(inputStream));
        }

        public String next() {
            return hasMoreTokens() ? in.nextToken() : null;
        }

        public String rl() {
            try {
                return br.readLine();
            } catch (Exception e) {
                e.printStackTrace();
                return null;
            }
        }

        boolean hasMoreTokens() {
            while (in == null || !in.hasMoreTokens()) {
                String s = rl();
                if (s == null)
                    return false;
                in = new StringTokenizer(s);
            }
            return true;
        }

        public String nextString() {
            return next();
        }

        public int ni() {
            return Integer.parseInt(nextString());
        }

        public double nd() {
            return Double.parseDouble(nextString());
        }

        public long nl() {
            return Long.parseLong(nextString());
        }

        public int[] nia(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        }

        public long[] nla(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = ni();
            }
            return a;
        }
    }

    class Pair implements Comparable<Pair> {
        long _first, _second;

        public Pair(int f, int s) {
            _first = f;
            _second = s;
        }

        public Pair(Long f, Long s) {
            _first = f;
            _second = s;
        }

        public int compareTo(Pair o) {
            if (this.first() != o.first())
                return Long.compare(this.first(), o.first());
            else
                return Long.compare(this.second(), o.second());
        }

        long first() {
            return _first;
        }

        long second() {
            return _second;
        }

        int firsti() {
            return (int) _first;
        }

        int secondi() {
            return (int) _second;
        }
    }

    class Triple implements Comparable<Triple> {
        Integer _first, _second, _third;

        public Triple(Integer f, Integer s, Integer t) {
            _first = f;
            _second = s;
            _third = t;
        }

        public int compareTo(Triple o) {
            if (!this.first().equals(o.first()))
                return this.first() - o.first();
            else if (!this.second().equals(o.second()))
                return this.second() - o.second();
            else
                return this.third() - o.third();
        }

        Integer first() {
            return _first;
        }

        Integer second() {
            return _second;
        }

        Integer third() {
            return _third;
        }

        public String toString() {
            return first() + " " + second() + " " + third();
        }
    }
}