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 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Question question = new Question();
        question.solve(sc);
    }

    static class Question {
        public void solve(Scanner in) {
            // int n = sc.nextInt();
            // while(n-- > 0) {
            //     for(int i = 0; i < 9; ++i) {
            //         String str = sc.next();
            //         for(int j = 0; j < 9; ++j) {
            //             if(str.charAt(j) == '1') System.out.print('2');
            //             else System.out.print(str.charAt(j));
            //         }
            //         System.out.print("\n");
            //     }
            // }
            int ntc = in.nextInt();
            while ((ntc--) > 0) {
                int[][] arr = new int[9][9];
                for (int i = 0; i < 9; i++) {
                    arr[i] = new int[9];
                    String x = in.next();
                    for (int j = 0; j < 9; j++) {
                        arr[i][j] = x.charAt(j) - '0';
                        if (arr[i][j] == 1) {
                            arr[i][j] = 2;
                        }
                    }
                }
                StringBuilder ans = new StringBuilder();
                for (int i = 0; i < 9; i++) {
                    for (int j = 0; j < 9; j++) {
                        ans.append(arr[i][j]);
                    }
                    ans.append("\n");
                }
                System.out.println(ans);
            }
        }
    }
}