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;
inline int read() {
  int ans = 0, mark = 1;
  int t = getchar();
  while (t < '0' || t > '9') {
    if (t == '-') mark = -1;
    t = getchar();
  }
  while (t <= '9' && t >= '0') {
    ans = (ans << 3) + (ans << 1) + t - '0';
    t = getchar();
  }
  return ans * mark;
}
int qmi(int a, int b, int p) {
  int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % p;
    a = a * a % p;
    b >>= 1;
  }
  return res;
}
const int INF = 0x3f3f3f3f;
const int N = 1e6 + 5, p = 1e9 + 7;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int(Loop_var) = read();
  while (Loop_var--)
    for (int _ = 1; _ <= (9); _++)
      for (int __ = 1; __ <= (10); __++) {
        char t = getchar();
        if (t == '9')
          putchar('1');
        else
          putchar(t);
      }
  return 0;
}