#include <iostream>

using namespace std;

const int MAXW = 15, MAXH = 15;

int Q;
int W, H, D, MX, MY, HX, HY, VX, VY;
bool hit[MAXW + 1][MAXH + 1];

int gcd(int a, int b) {
	if (a == 0) {
		return b;
	} else {
		return gcd(b % a, a);
	}
}

int main() {
	cin >> Q;
	for (int i = 0; i < Q; i++) {
		cin >> W >> H >> D >> MX >> MY >> HX >> HY >> VX >> VY;
		for (int x = 0; x <= W; x++) {
			for (int y = 0; y <= H; y++) {
				hit[x][y] = false;
			}
		}
		int g = gcd(abs(VX), abs(VY));
		VX /= g;
		VY /= g;
		D *= g;
		for (int i = 0; i <= min(D, (MAXW + 1) * (MAXH + 1) * 4 + 1); i++) {
			int x = abs(HX + i * VX) % (2 * W), y = abs(HY + i * VY) % (2 * H);
			if (x > W) {
				x = 2 * W - x;
			}
			if (y > H) {
				y = 2 * H - y;
			}
			hit[x][y] = true;
		}
		if (hit[MX][MY]) {
			cout << "Hit" << endl;
		} else {
			cout << "Miss" << endl;
		}
	}
	return 0;
}