def gcd(a,b):
    if b<a:
        return gcd(b,a)
    if b%a==0:
        return a
    return gcd(b%a,a)

Q=int(raw_input())
for i in range(Q):
    W,H,D,Mx,My,Hx,Hy,Vx,Vy=map(int,raw_input().split())
    Vg=max(abs(Vx),abs(Vy))
    if Vx!=0 and Vy!=0:
        Vg=gcd(abs(Vx),abs(Vy))
    Vx/=Vg
    Vy/=Vg
    D*=Vg
    table = [[[False for i in range(4)] for j in range(H+1)] for k in range(W+1)]
    table[Hx][Hy][0]=True
    x,y,dx,dy=Hx,Hy,Vx,Vy
    di=0
    while di <D:
        nx,ny=x+dx,y+dy
        while nx > W or ny > H or nx <0 or ny < 0:
            if nx > W:
                nx=2*W-nx
                dx*=-1
            if ny > H:
                ny=2*H-ny
                dy*=-1
            if nx < 0:
                nx=-nx
                dx*=-1
            if ny < 0:
                ny=-ny
                dy*=-1
        flag = 0
        if Vx!=dx:
            flag+=1
        if Vy!=dy:
            flag+=2
        #print nx,ny,flag
        if table[nx][ny][flag]:
            break
        table[nx][ny][flag]=True
        if nx==Mx and ny==My:
            break
        x,y=nx,ny
        di+=1
    if table[Mx][My][0] or table[Mx][My][1] or table[Mx][My][2] or table[Mx][My][3]:
        print "Hit"
    else:
        print "Miss"
    # find k s.t. Hx+kVx= 2mW+Mx and Hy+kVy = 2nH+My
    # find k s.t. Hx+kVx= 2mW-Mx and Hy+kVy = 2nH-My