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


public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        StringBuilder ans = new StringBuilder();
        while (t-- > 0) {
            char[][] m = new char[9][9];
            for (int i = 0; i < 9; i++) {
                String s = sc.next();
                for (int j = 0; j < 9; j++) {
                    m[i][j] = s.charAt(j);
                }
            }
            m[0][6] = m[0][5];
            m[1][1] = m[1][0];
            m[2][5] = m[2][8];
            m[3][8] = m[3][5];
            m[4][2] = m[4][0];
            m[5][4] = m[5][7];
            m[6][7] = m[6][6];
            m[7][0] = m[7][1];
            m[8][3] = m[8][2];
            for (int i = 0; i < 9; i++) {
                for (int j = 0; j < 9; j++) {
                    ans.append(m[i][j]);
                }
                ans.append('\n');
            }
        }
        System.out.print(ans);
    }
}