#include <bits/stdc++.h>
long long prime[1000002];
using namespace std;
int Prime(int a) {
  for (int i = 2; i <= a / 2; ++i) {
    if (a % i == 0) {
      return 0;
    }
  }
  return 1;
}
void sieve() {
  for (int i = 0; i <= 1000001; i++) prime[i] = 0;
  int maxn = 1000001;
  for (int i = 2; i <= maxn; i++) {
    if (prime[i] == 0) {
      for (int j = i; j <= maxn; j += i) {
        prime[j]++;
      }
    }
  }
}
void fibo(long long a[], long long n) {
  long long x = 0;
  long long y = 1;
  a[0] = 0;
  a[1] = 1;
  for (long long i = 2; i < n; ++i) {
    a[i] = (x + y) % 10;
    x = y;
    y = a[i];
  }
}
long long f(long long w[], long long a[][2], long long i, long long y) {
  for (long long j = 0; j < y; ++j) {
    if (a[i][2] <= w[j]) {
      cout << a[i][2];
      return w[j];
    }
  }
  return w[y - 1];
}
long long s(long long v[], long long a[][2], long long i, long long x) {
  for (long long j = 0; j < x; ++j) {
    if (a[i][1] >= v[j]) {
      cout << " " << a[i][1] << " ";
      return v[j];
    }
  }
  return v[0];
}
bool binarySearch(vector<long long> arr, int l, int r, int x) {
  if (r >= l) {
    int mid = l + (r - l) / 2;
    if (arr[mid] == x) return 1;
    if (arr[mid] > x) return binarySearch(arr, l, mid - 1, x);
    return binarySearch(arr, mid + 1, r, x);
  }
  return 0;
}
int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  char c;
  long long i, j = 0, t;
  cin >> t;
  while (t--) {
    for (i = 0; i < 9; ++i) {
      for (j = 0; j < 9; ++j) {
        cin >> c;
        if (c == '2') {
          cout << 1;
        } else {
          cout << c;
        }
      }
      cout << endl;
    }
    cout << endl;
  }
  return 0;
}
