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;
using namespace chrono;
void debugging(int value) { cerr << value; }
void debugging(long long int value) { cerr << value; }
void debugging(unsigned long long int value) { cerr << value; }
void debugging(double value) { cerr << value; }
void debugging(bool value) { cerr << value; }
void debugging(char value) { cerr << "'" << value << "'"; }
void debugging(string value) { cerr << "\"" << value << "\""; }
template <class T>
void debugging(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    debugging(i);
    cerr << " ";
  }
  cerr << "] ";
}
template <class T>
void debuggingarray(T array, int n) {
  cerr << "[ ";
  for (int i = 0; i < n; i++) {
    debugging(array[i]);
    cerr << " ";
  }
  cerr << "] ";
}
template <class T>
T minftn(T num1, T num2) {
  T num = (num1 < num2) ? (num1) : (num2);
  return num;
}
template <class T>
T maxftn(T num1, T num2) {
  T num = (num1 > num2) ? (num1) : (num2);
  return num;
}
template <class T>
T minarray(T array[], int n) {
  T num = array[0];
  for (int i = 0; i < n; i++) {
    if (array[i] < num) {
      num = array[i];
    }
  }
  return num;
}
template <class T>
T maxarray(T array[], int n) {
  T num = array[0];
  for (int i = 0; i < n; i++) {
    if (array[i] > num) {
      num = array[i];
    }
  }
  return num;
}
template <class T>
T minindex(T array[], int n) {
  T num = array[0];
  int index;
  for (int i = 0; i < n; i++) {
    if (array[i] < num) {
      num = array[i];
      index = i;
    }
  }
  return index;
}
template <class T>
T maxindex(T array[], int n) {
  T num = array[0];
  int index;
  for (int i = 0; i < n; i++) {
    if (array[i] > num) {
      num = array[i];
      index = i;
    }
  }
  return index;
}
template <class T>
T gcdftn(T num1, T num2) {
  if (num1 == num2) {
    return num1;
  } else {
    return gcd(num2, num1 % num2);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    string s[9];
    for (int i = 0; i < 9; i++) {
      cin >> s[i];
    }
    int a[9][9];
    for (int i = 0; i < 9; i++) {
      for (int j = 0; j < 9; j++) {
        a[i][j] = (int)s[i][j] - '0';
        if (a[i][j] == 1) {
          cout << "2";
        } else {
          cout << a[i][j];
        }
      }
      cout << "\n";
    }
  }
  return 0;
}