#include <bits/stdc++.h>
using namespace std;

int modulo(int x, int mod) {
	x %= mod;
	if (x < 0) {
		x += mod;
	}
	return x;
}

bool solve() {
	int w, h, d, mx, my, hx, hy, vx, vy;
	cin >> w >> h >> d >> mx >> my >> hx >> hy >> vx >> vy;

	int g = __gcd(abs(vx), abs(vy));
	vx /= g;
	vy /= g;
	d *= g;

	for (int i = 0; i < min(d, 2000); i++) {
		hx = modulo(hx + vx, 2 * w);
		hy = modulo(hy + vy, 2 * h);
		if (hx == mx && hy == my) return true;
		if (hx == w + (w - mx) && hy == my) return true;
		if (hx == mx && hy == h + (h - my)) return true;
		if (hx == w + (w - mx) && hy == h + (h - my)) return true;
	}

	return false;
}

int main() {
	int q;
	cin >> q;
	while (q--) {
		puts(solve() ? "Hit" : "Miss");
	}
}