def gcd(a, b):
    if b == 0:
        return a
    else:
        return gcd(b, a % b)
q = int(input())
while q:
    q -= 1
    w, h, d, mx, my, hx, hy, vx, vy = map(int, input().split())
    g = gcd(abs(vx), abs(vy))
    vx //= g
    vy //= g
    d *= g
    for t in range(1, min(d+1, (h+1)*(w+1)*4)):
        cx = abs(hx + t * vx)
        cy = abs(hy + t * vy)
        cx %= 2 * w
        if cx > w:
            cx = 2 * w - cx
        cy %= 2 * h
        if cy > h:
            cy = 2 * h - cy
        if cx == mx and cy == my:
            break
    print("Hit" if cx == mx and cy == my else "Miss")