#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int a[3][3][3];
    rep(i, 3) rep(j, 3) rep(k, 3) cin >> a[i][j][k];
    using A = array<array<int, 3>, 3>;
    A x, y, z;
    rep(j, 3) rep(k, 3) cin >> x[j][k];
    rep(i, 3) rep(k, 3) cin >> y[i][k];
    rep(i, 3) rep(j, 3) cin >> z[i][j];
    int ans = 100;
    array<int, 3> pi, pj, pk;
    rep(z, 3) pi[z] = pj[z] = pk[z] = z;
    auto op_cnt = [](array<int, 3> p) {
      bool visited[3]{};
      int res = 3;
      rep(i, 3) if (!visited[i]) {
        res--;
        while (!visited[i]) visited[exchange(i, p[i])] = true;
      }
      return res;
    };
    do do do [&]() {
      A nx{}, ny{}, nz{};
      rep(i, 3) rep(j, 3) rep(k, 3) {
        int v = a[pi[i]][pj[j]][pk[k]];
        nx[j][k] += v, ny[i][k] += v, nz[i][j] += v;
      }
      if (nx == x && ny == y && nz == z) chmin(ans, op_cnt(pi) + op_cnt(pj) + op_cnt(pk));
    }(); while (next_permutation(all(pk))); while(next_permutation(all(pj))); while(next_permutation(all(pi)));
    if (ans == 100) ans = -1;
    cout << ans << '\n';
  }
}