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 gridNumber(int i, int j) { return 3 * (i / 3) + (j / 3); }
void solve() {
  vector<string> sudoku;
  for (int i = 0; i < 9; i++) {
    string temp;
    cin >> temp;
    sudoku.push_back(temp);
  }
  vector<bool> row(9, false), col(9, false), grid(9, false), num(10, false);
  int k = 1;
  int count = 0;
  for (int i = 0; i < 9; i++) {
    for (int j = 0; j < 9; j++) {
      if (!row[i] && !col[j] && !grid[gridNumber(i, j)]) {
        count++;
        sudoku[i][j] = sudoku[i][j] == '1' ? '2' : '1';
        num[k] = true;
        row[i] = true;
        col[j] = true;
        grid[gridNumber(i, j)] = true;
      }
    }
  }
  for (int i = 0; i < 9; i++) {
    cout << sudoku[i] << "\n";
  }
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  srand(time(0));
  long long int test = 1;
  cin >> test;
  for (long long int i = 0; i < test; i++) {
    solve();
  }
}