from math import gcd

def ext_gcd(a, b):
    """
    return (x, y, gcd(a, b)) s.t. ax + by = gcd(a, b)
    """
    if a == 0:
        return (0, 1, b)
    else:
        X, Y, g = ext_gcd(b % a, a)
        return (Y - b // a * X, X, g)

def solve(w, h, d, mx, my, hx, hy, vx, vy):
    if vx == 0 and vy == 0:
        return mx == hx and my == hy
            
    g = gcd(vx, vy)
    vx //= g
    vy //= g
    d *= g

    if vx < 0:
        vx *= -1
        mx = w - mx
        hx = w - hx

    if vy < 0:
        vy *= -1
        my = h - my
        hy = h - hy

    if vy == 0:
        vx, vy = vy, vx
        mx, my = my, mx
        hx, hy = hy, hx
        h, w = w, h

    if vx == 0:
        if mx != hx:
            return False
        elif hy <= my <= hy + d or hy <= 2 * h - my <= hy + d:
            return True
        else:
            return False

    def ok(mx, my):
        a = 2 * w * vy
        b = 2 * h * vx
        x, y, g = ext_gcd(a, -b)
        c = vx * (my - hy) - vy * (mx - hx)
        if c % g != 0:
            return False
        a //= g
        b //= g
        c //= g
        x *= c
        y *= c
        e = x // b
        x -= b * e
        y -= a * e
        if y < 0:
            e = abs(y) // b
            x += b * e
            y += a * e
        t = (mx + 2 * w * x - hx) // vx
        return t <= d
        

    for _ in range(2):
        for _ in range(2):
            if ok(mx, my):
                return True

            mx = 2 * w - mx
        my = 2 * h - my

    return False

for _ in range(int(input())):
    if solve(*map(int, input().split())):
        print("Hit")
    else:
        print("Miss")