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 fractions import Fraction

# def ex(l, r, a, b):
#     return (a*r-b*l)*pow(a-b, md-2, md)%md, Fraction(a*r-b*l, a-b)
def ex(l, r, a, b):
    return (a*r-b*l)*pow(a-b, md-2, md)%md, (a*r-b*l)/(a-b)

def outer(v, w):
    return v[0]*w[1]-v[1]*w[0]

def solve():
    ax, ay, az = LI()
    bx, by, bz = LI()
    cx, cy, cz = LI()
    lx, ly, lz = LI()
    ax, fax = ex(lx, ax, lz, az)
    ay, fay = ex(ly, ay, lz, az)
    bx, fbx = ex(lx, bx, lz, bz)
    by, fby = ex(ly, by, lz, bz)
    cx, fcx = ex(lx, cx, lz, cz)
    cy, fcy = ex(ly, cy, lz, cz)
    fab = [fbx-fax, fby-fay]
    fac = [fcx-fax, fcy-fay]
    ab = [bx-ax, by-ay]
    ac = [cx-ax, cy-ay]
    if outer(fab, fac) > 0:
        ans = outer(ab, ac)
    else:
        ans = outer(ac, ab)
    print(ans*pow(2, md-2, md)%md)

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