#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
typedef unsigned long long ul;
int gcd(int a, int b) {
	a = abs(a), b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		int r = a % b; a = b; b = r;
	}
	return a;
}
int main() {
	int q; cin >> q;
	rep(aa, q) {
		int w, h, d, gx, gy, sx, sy, vx, vy;
		cin >> w >> h >> d >> gx >> gy >> sx >> sy >> vx >> vy;
		int g = gcd(vx, vy); vx /= g; vy /= g;
		d = min(d*g, 2000);
		int cx = sx, cy = sy;
		bool y = false;
		rep(i, d) {
			cx += vx; cy += vy;
			while (cx<0 || cx>w) {
				if (cx < 0) {
					cx = -cx; vx = -vx;
				}
				else {
					cx = 2 * w - cx; vx = -vx;
				}
			}
			while (cy<0 || cy>h) {
				if (cy < 0) {
					cy = -cy; vy = -vy;
				}
				else {
					cy = 2 * h - cy; vy = -vy;
				}
			}
			if (cx == gx && cy == gy)y = true;
		}
		if (y)cout << "Hit" << endl;
		else cout << "Miss" << endl;
	}
	//stop
	return 0;
}