#include <iostream>
#include <fstream>
#include <set>
using namespace std;

static const int pat[][6]={
  {1,2,3,5,4,6},
  {1,3,5,4,2,6},
  {1,5,4,2,3,6},
  {1,4,2,3,5,6},

  {2,1,4,6,3,5},
  {2,4,6,3,1,5},
  {2,6,3,1,4,5},
  {2,3,1,4,6,5},

  {3,1,2,6,5,4},
  {3,2,6,5,1,4},
  {3,6,5,1,2,4},
  {3,5,1,2,6,4},

  {4,2,1,5,6,3},
  {4,1,5,6,2,3},
  {4,5,6,2,1,3},
  {4,6,2,1,5,3},

  {5,4,1,3,6,2},
  {5,1,3,6,4,2},
  {5,3,6,4,1,2},
  {5,6,4,1,3,2},

  {6,2,4,5,3,1},
  {6,4,5,3,2,1},
  {6,5,3,2,4,1},
  {6,3,2,4,5,1},
};

void solve(int x,int y,int z,int (*tbl)[3][3],int (*top)[3],int (*front)[3],set<int> &ans)
{
//  cout<<x<<" "<<y<<" "<<z<<endl;
  if (x==3)
    solve(0,y+1,z,tbl,top,front,ans);
  else if (y==3)
    solve(0,0,z+1,tbl,top,front,ans);
  else if (z==3){
    int v=0;
    for (int x=0;x<3;x++)
      for (int y=0;y<3;y++)
        v+=pat[tbl[2][y][x]][2];
    ans.insert(v);
  }
  else{
    for (int i=0;i<24;i++){
      const int *dice=pat[i];
      if (x==0&&front[y][z]!=0) // front チェック
        if (front[y][z]!=dice[1]) continue;
      if (y==0&&top[x][z]!=0) // top チェック
        if (top[x][z]!=dice[0]) continue;

      if ((x!=0&&pat[tbl[z][y][x-1]][3]+dice[1]!=7) ||
          (y!=0&&pat[tbl[z][y-1][x]][5]+dice[0]!=7) ||
          (z!=0&&pat[tbl[z-1][y][x]][2]+dice[4]!=7))
        continue;
      
      // 置ける
      tbl[z][y][x]=i;
      solve(x+1,y,z,tbl,top,front,ans);
    }
  }
}

int main()
{
  ifstream cin("F.txt");

  int cases;cin>>cases;
  while(cases--){
    int top[3][3],front[3][3];
    for (int i=0;i<3;i++)
      for (int j=0;j<3;j++)
        cin>>top[i][j];
    for (int i=0;i<3;i++)
      for (int j=0;j<3;j++)
        cin>>front[i][j];

    int tbl[3][3][3];
    set<int> ans;
    solve(0,0,0,tbl,top,front,ans);
    if (ans.empty())
      cout<<0<<endl;
    else{
      set<int>::iterator p=ans.begin();
      cout<<*p;
      for(p++;p!=ans.end();p++)
        cout<<" "<<*p;
      cout<<endl;
    }
  }
  return 0;
}