#include <bits/stdc++.h>
long long exp(long long x, long long y, long long p) {
  long long res = 1;
  while (y) {
    if (y % 2) res = (res * x % p) % p;
    x = (x * x) % p;
    y /= 2;
  }
  return res;
}
long long expo(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y % 2) res = (res * x % ((int)1e9 + 7)) % ((int)1e9 + 7);
    x = (x * x) % ((int)1e9 + 7);
    y /= 2;
  }
  return res;
}
long long add(long long a, long long b) {
  return (a % ((int)1e9 + 7) + b % ((int)1e9 + 7) + ((int)1e9 + 7)) %
         ((int)1e9 + 7);
}
long long sub(long long a, long long b) {
  return (a % ((int)1e9 + 7) - b % ((int)1e9 + 7) + ((int)1e9 + 7)) %
         ((int)1e9 + 7);
}
long long mul(long long a, long long b) {
  return ((a % ((int)1e9 + 7)) * (b % ((int)1e9 + 7)) + ((int)1e9 + 7)) %
         ((int)1e9 + 7);
}
long long inv(long long x) { return expo(x, ((int)1e9 + 7) - 2); }
using namespace std;
int sv[2000006] = {1};
void sve() {
  for (int i = 2; i * i < 100001; i++) {
    if (!sv[i]) {
      for (int j = i * i; j < ((int)2e6 + 6); j += i) sv[j] = 1;
    }
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n = 9;
    vector<string> v;
    for (int i = 0; i < n; i++) {
      string a;
      cin >> a;
      v.push_back(a);
    }
    v[0][0] = '0' + (v[0][0] % 9) + 1;
    v[1][3] = '0' + (v[1][3] % 9) + 1;
    v[2][6] = '0' + (v[2][6] % 9) + 1;
    v[3][1] = '0' + (v[3][1] % 9) + 1;
    v[4][4] = '0' + (v[4][4] % 9) + 1;
    v[5][7] = '0' + (v[5][7] % 9) + 1;
    v[6][2] = '0' + (v[6][2] % 9) + 1;
    v[7][5] = '0' + (v[7][5] % 9) + 1;
    v[8][8] = '0' + (v[8][8] % 9) + 1;
    for (int i = 0; i < n; i++) {
      cout << v[i] << endl;
    }
  }
}
