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;
struct point {
  int x, y;
  point() {}
  point(int a, int b) { x = a, y = b; }
};
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T power(T n, T p) {
  T res = 1;
  for (int i = 0; i < p; i++) res *= n;
  return res;
}
template <class T>
double getdist(T a, T b) {
  return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
template <class T>
T extract(string s, T ret) {
  stringstream ss(s);
  ss >> ret;
  return ret;
}
template <class T>
string tostring(T n) {
  stringstream ss;
  ss << n;
  return ss.str();
}
struct fast {
  fast() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
  }
} cincout;
char s[10][10];
vector<pair<int, int>> v{{1, 1}, {2, 4}, {3, 7}, {4, 2}, {5, 5},
                         {6, 8}, {7, 3}, {8, 6}, {9, 9}};
bool rec(int indx) {
  if (indx == (int)(v.size())) return true;
  for (int i = 0; i < 9; i++) {
    auto x = v[indx];
    if (i == s[x.first][x.second] - '1') continue;
    char old = s[x.first][x.second];
    s[x.first][x.second] = i + '1';
    if (rec(indx + 1)) return true;
    s[x.first][x.second] = old;
  }
  return false;
}
int main() {
  int test;
  cin >> test;
  while (test--) {
    for (int i = 1; i <= 9; i++)
      for (int j = 1; j <= 9; j++) cin >> s[i][j];
    assert(rec(0) == true);
    for (int i = 1; i < 10; i++) {
      for (int j = 1; j < 10; j++) cout << s[i][j];
      cout << "\n";
    }
  }
  return 0;
}