import sys
input=lambda:sys.stdin.readline().rstrip()
def gcd(a,b):
	if a*b==0:
		return a+b
	return gcd(a%b,b%a) if min(a,b,abs(a-b)) else max(a,b)
def lcm(a,b):
	return a*b//gcd(a,b)
def euclid(a,b):
	if a<0:
		temp=euclid(-a,b)
		return [-temp[0],temp[1]]
	if b<0:
		temp=euclid(a,-b)
		return [temp[0],-temp[1]]
	if a==1:
		return [1,0]
	if b==1:
		return [0,1]
	if a*b==0:
		return -1
	if b>a:
		temp=euclid(a,b%a)
		return [temp[0]-(b//a)*temp[1],temp[1]]
	else:
		temp=euclid(a%b,b)
		return [temp[0],temp[1]-(a//b)*temp[0]]
def calc(W,M,H,V):
	ans=[0 for i in range(2)]
	g=gcd(abs(V),abs(2*W))
	right=[M-H,2*W-M-H]
	for i in range(2):
		if right[i]%g:
			ans[i]=-1
			continue
		right[i]//=g
		ans[i]=[(euclid(V//g,2*W//g)[0]*right[i])%W,W]
	return ans
def solve():
	temp=list(map(int,input().split()))
	temp[:3]=[temp[2]]+temp[:2]
	g=gcd(abs(temp[7]),abs(temp[8]))
	temp[0]*=g
	temp[7]//=g
	temp[8]//=g
	flg=0
	r=[calc(*temp[i::2]) for i in range(1,3)]
	for i in range(4):
		ret=[r[0][i%2],r[1][i//2]]
		if -1 in ret:
			continue
		if (ret[0][0]-ret[1][0])%gcd(abs(ret[0][1]),abs(ret[1][1])):
			continue
		R=euclid(ret[0][1],-ret[1][1])[0]*(ret[1][0]-ret[0][0])*ret[0][1]+ret[0][0]
		R%=lcm(abs(ret[0][1]),abs(ret[1][1]))
		flg|=(R<=temp[0])
	print(["Miss","Hit"][flg])
N=int(input())
for i in range(N):
	solve()