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;
const long long MOD = 998244353;
const long long INF = 1e10;
using Graph = vector<vector<long long>>;
char solve(char a) {
  if (a == '9')
    a = '1';
  else
    a++;
  return a;
}
signed main() {
  long long T;
  cin >> T;
  for (long long t = 0; t < (long long)(T); t++) {
    vector<string> A(9);
    for (long long i = 0; i < (long long)(9); i++) cin >> A[i];
    A[0][0] = solve(A[0][0]);
    A[1][3] = solve(A[1][3]);
    A[2][6] = solve(A[2][6]);
    A[3][1] = solve(A[3][1]);
    A[4][4] = solve(A[4][4]);
    A[5][7] = solve(A[5][7]);
    A[6][2] = solve(A[6][2]);
    A[7][5] = solve(A[7][5]);
    A[8][8] = solve(A[8][8]);
    for (long long i = 0; i < (long long)(9); i++) cout << A[i] << endl;
  }
}