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>
const int Z = (int)1e5 + 123;
const int inf = (int)1e9 + 123;
const long long llinf = (long long)1e18 + 123;
using namespace std;
int a[11][11];
int used[10];
int main() {
  int t;
  cin >> t;
  while (t--) {
    for (int i = 1; i <= 9; i++) {
      string s;
      cin >> s;
      for (int j = 0; j < 9; j++) {
        a[i][j + 1] = ((int)s[j] - (int)('0'));
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][1]]++;
      used[a[1][i]]++;
    }
    used[a[1][1]] -= 2;
    for (int i = 1; i <= 3; i++) {
      for (int j = 1; j <= 3; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[1][1]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[1][1]) {
        a[1][1] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][4]]++;
      used[a[4][i]]++;
    }
    used[a[4][2]] -= 2;
    for (int i = 4; i <= 6; i++) {
      for (int j = 1; j <= 3; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[4][2]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[4][2]) {
        a[4][2] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][3]]++;
      used[a[7][i]]++;
    }
    used[a[7][3]] -= 2;
    for (int i = 7; i <= 9; i++) {
      for (int j = 1; j <= 3; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[7][3]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[7][3]) {
        a[7][3] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][4]]++;
      used[a[2][i]]++;
    }
    used[a[2][4]] -= 2;
    for (int i = 1; i <= 3; i++) {
      for (int j = 4; j <= 6; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[2][4]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[2][4]) {
        a[2][4] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][5]]++;
      used[a[5][i]]++;
    }
    used[a[5][5]] -= 2;
    for (int i = 4; i <= 6; i++) {
      for (int j = 4; j <= 6; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[5][5]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[5][5]) {
        a[5][5] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][6]]++;
      used[a[8][i]]++;
    }
    used[a[8][6]] -= 2;
    for (int i = 7; i <= 9; i++) {
      for (int j = 4; j <= 6; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[8][6]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[8][6]) {
        a[8][6] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][7]]++;
      used[a[3][i]]++;
    }
    used[a[3][7]] -= 2;
    for (int i = 1; i <= 3; i++) {
      for (int j = 7; j <= 9; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[3][7]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[3][7]) {
        a[3][7] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][8]]++;
      used[a[6][i]]++;
    }
    used[a[6][8]] -= 2;
    for (int i = 4; i <= 6; i++) {
      for (int j = 7; j <= 9; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[6][8]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[6][8]) {
        a[6][8] = i;
        break;
      }
    }
    fill(used + 1, used + 10, 0);
    for (int i = 1; i <= 9; i++) {
      used[a[i][9]]++;
      used[a[9][i]]++;
    }
    used[a[9][9]] -= 2;
    for (int i = 7; i <= 9; i++) {
      for (int j = 7; j <= 9; j++) {
        used[a[i][j]]++;
      }
    }
    used[a[9][9]]--;
    for (int i = 1; i <= 9; i++) {
      if (used[i] == 3 && i != a[9][9]) {
        a[9][9] = i;
        break;
      }
    }
    for (int i = 1; i <= 9; i++) {
      for (int j = 1; j <= 9; j++) {
        cout << a[i][j];
      }
      cout << endl;
    }
  }
  return 0;
}