#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MX = 2e5 + 7;
const int mod = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long k) {
  long long res = 1;
  while (k) {
    if (k & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    k >>= 1;
  }
  return res;
}
int mp[10][10];
void f(int x, int y) {
  int num = mp[x][y];
  for (int i = 1; i < 10; ++i) {
    if (i != num) {
      mp[x][y] = i;
      return;
    }
  }
}
int main() {
  int T;
  cin >> T;
  while (T--) {
    for (int i = 1; i <= 9; ++i) {
      for (int j = 1; j <= 9; ++j) {
        scanf("%1d", &mp[i][j]);
      }
    }
    f(1, 1);
    f(2, 5);
    f(3, 9);
    f(4, 2);
    f(5, 4);
    f(6, 7);
    f(7, 3);
    f(8, 6);
    f(9, 8);
    for (int i = 1; i <= 9; ++i) {
      for (int j = 1; j <= 9; ++j) {
        cout << mp[i][j];
      }
      cout << '\n';
    }
  }
  return 0;
}
