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

/**
 * Made by egor https://github.com/chermehdi/egor.
 * 
 * @author Azuz
   
 */
public class Main {

    void solve(Scanner in, PrintWriter out) {
        int t = in.nextInt();
        while (t-->0) {
            char[][] arr = new char[9][9];
            for (int i = 0; i < 9; ++i) {
                char[] tmp = in.next().toCharArray();
                for (int j = 0; j < 9; ++j) {
                    arr[i][j] = tmp[j];
                    if (arr[i][j] == '1') {
                        arr[i][j] = '2';
                    }
                }
            }

            //out.println(isAnti(arr));
            for (int i = 0; i < 9; ++i) {
                for (int j = 0; j < 9; ++j) {
                    out.print(arr[i][j]);
                } out.println();
            }
        }
    }

    public static boolean isAnti(char[][] arr) {
        int[][][] cb = new int[3][3][10];
        boolean[][] bb = new boolean[3][3];
        boolean[] bc = new boolean[9];
        int[][] cc = new int[9][10];
        for (int i = 0; i < 9; ++i) {
            boolean antiRow = false;
            
            int[] cr = new int[10];
            
            for (int j = 0; j < 9; ++j) {
                ++cr[arr[i][j] - '0'];
                if (cr[arr[i][j] - '0'] == 2) {
                    antiRow = true;
                }
                ++cc[j][arr[i][j] - '0'];
                if (cc[j][arr[i][j] - '0'] == 2) {
                    bc[j] = true;
                }

                ++cb[i/3][j/3][arr[i][j] - '0'];
                if (cb[i/3][j/3][arr[i][j] - '0'] == 2) {
                    bb[i/3][j/3] = true;
                }
            }
            if (!antiRow) return false;
        }

        for (int j = 0; j < 9; ++j) {
            if (!bc[j]) return false;
        }

        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
                if (!bb[i][j]) {
                    return false;
                }
            }
        }
        
        return true;
    }

    public static void main(String[] args) {
        try(Scanner in = new Scanner(System.in);
            PrintWriter out = new PrintWriter(System.out)) {
            new Main().solve(in, out);
        }
    }
}