#include <bits/stdc++.h>

using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define mem(a,val) memset(a,val,sizeof a)

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define endl '\n'

bool flag = 0;
int n = 9,tot,val[11],g[11][11];
pair<pair<int,int>,int> vv[111];
vector< pair<pair<int,int>,int> > v;

bool cmp(pair<pair<int,int>,int> A, pair<pair<int,int>,int>B)
{
  return A.ss > B.ss;
}

bool check(int x, int y, int num)
{
  for(int i = 1; i <= n; ++i){
    if(g[x][i] == num or g[i][y] == num) return false;
  }
  x = ((x-1)/3)*3;
  y = ((y-1)/3)*3;
  for(int i = 1; i <= 3; ++i){
    for(int j = 1; j <= 3; ++j){
      if(g[x+i][y+j] == num) return false;
    }
  }
  return true;
}

void backtrack(int idx)
{
  if(flag) return;
  if(idx == tot){
    flag = 1;
    for(int i = 1; i <= n; ++i){
      for(int j = 1; j <= n; ++j){
        cout << g[i][j];
      }
      cout << endl;
    }
    return;
  }
  int x = vv[idx].ff.ff;
  int y = vv[idx].ff.ss;
  for(int i = 1; i <= 9; ++i){
    if(check(x,y,i)){
      g[x][y] = i;
      backtrack(idx+1);
      if(flag) return;
      g[x][y] = 0;
    }
  }
}

int main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);
  #ifndef ONLINE_JUDGE
    freopen("in", "r", stdin);
    freopen("out","w",stdout);
  #endif
  int t;
  cin >> t;
  for(int cs = 1; cs <= t; ++cs){
    flag = 0;
    mem(g,0);
    mem(val,0);
    for(int i = 1; i <= n; ++i){
      for(int j = 1; j <= n; ++j){
        char c;
        cin >> c;
        if(c == '.') v.pb({{i,j},0});
        else{
          g[i][j] = (c-'0');
          val[i]++;
          val[j]++;
        }
      }
    }
    tot = v.size();
    for(int i = 0; i < tot; ++i){
      v[i].ss = (val[v[i].ff.ff]+val[v[i].ff.ss]);
    }
    for(int i = 0; i < tot; ++i) vv[i] = v[i];
    sort(vv,vv+tot,cmp);
    cout << "Case " << cs << ":" << endl;
    backtrack(0);
    v.clear();
  }
}