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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  string s1, s2, s3, s4, s5, s6, s7, s8, s9;
  cin >> t;
  for (int o = 1; o <= t; o++) {
    cin >> s1 >> s2 >> s3 >> s4 >> s5 >> s6 >> s7 >> s8 >> s9;
    if (s1[0] == '9') {
      s1[0] = '1';
    } else
      s1[0]++;
    if (s2[3] == '9') {
      s2[3] = '1';
    } else
      s2[3]++;
    if (s3[6] == '9') {
      s3[6] = '1';
    } else
      s3[6]++;
    if (s4[1] == '9') {
      s4[1] = '1';
    } else
      s4[1]++;
    if (s5[4] == '9') {
      s5[4] = '1';
    } else
      s5[4]++;
    if (s6[7] == '9') {
      s6[7] = '1';
    } else
      s6[7]++;
    if (s7[2] == '9') {
      s7[2] = '1';
    } else
      s7[2]++;
    if (s8[5] == '9') {
      s8[5] = '1';
    } else
      s8[5]++;
    if (s9[8] == '9') {
      s9[8] = '1';
    } else
      s9[8]++;
    cout << s1 << '\n'
         << s2 << '\n'
         << s3 << '\n'
         << s4 << '\n'
         << s5 << '\n'
         << s6 << '\n'
         << s7 << '\n'
         << s8 << '\n'
         << s9 << '\n';
  }
  return 0;
}