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 argc, const char *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc;
  cin >> tc;
  while (tc--) {
    vector<string> vect;
    string str;
    for (int i = (int)(1); i <= (int)(9); i++) {
      cin >> str;
      vect.push_back(str);
    }
    string s1;
    s1 = s1 + vect[0][0];
    long long val = stoi(s1);
    val = (val % 9) + 1;
    string s2 = to_string(val);
    char ch[2];
    ch[0] = s2[0];
    vect[0][0] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[1][3];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[1][3] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[2][6];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[2][6] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[3][1];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[3][1] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[4][4];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[4][4] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[5][7];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[5][7] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[6][2];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[6][2] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[7][5];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[7][5] = ch[0];
    s1.erase();
    s2.erase();
    s1 = s1 + vect[8][8];
    val = stoi(s1);
    val = (val % 9) + 1;
    s2 = to_string(val);
    ch[0] = s2[0];
    vect[8][8] = ch[0];
    for (int i = (int)(0); i <= (int)(8); i++) {
      cout << vect[i] << "\n";
    }
  }
}