import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from itertools import permutations
from collections import deque, defaultdict

pp = list(permutations(range(3)))
pn = len(pp)
cost = defaultdict(lambda: -1)
cost[pp[0]] = 0
q = deque()
q.append(pp[0])
while q:
    p = q.popleft()
    c = cost[p]
    for i in range(3):
        for j in range(3):
            l = list(p)
            l[i], l[j] = l[j], l[i]
            np = tuple(l)
            if cost[np] == -1:
                cost[np] = c+1
                q.append(np)

def solve():
    def ok():
        for i in range(3):
            ni = p[i]
            for j in range(3):
                nj = q[j]
                if zz[i][j] != ij[ni][nj]: return False
                for k in range(3):
                    nk = r[k]
                    if xx[j][k] != jk[nj][nk]: return False
                    if yy[i][k] != ik[ni][nk]: return False
        return True

    aa = [LLI(3) for _ in range(3)]
    xx = LLI(3)
    yy = LLI(3)
    zz = LLI(3)
    jk = [[0]*3, [0]*3, [0]*3]
    ik = [[0]*3, [0]*3, [0]*3]
    ij = [[0]*3, [0]*3, [0]*3]
    for i in range(3):
        for j in range(3):
            for k, a in enumerate(aa[i][j]):
                jk[j][k] += a
                ik[i][k] += a
                ij[i][j] += a
    ans = inf
    for p in pp:
        for q in pp:
            for r in pp:
                if ok(): ans = min(ans, cost[p]+cost[q]+cost[r])
    if ans == inf: ans = -1
    print(ans)

for _ in range(II()): solve()