#include <iostream>
#include <algorithm>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
using namespace std;
typedef long long ll;

int exgcd(int a, int b, int &g) {
	int u = 1, v = 0;
	while(b) {
		int t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	g = a;
	return u;
}

int red(int x, int y) {
	int z = x % y;
	return z < 0 ? z + y : z;
}

int W[2], D, M[2], H[2], V[2], s;
bool f(int m) {
	ll b = 0, n = 1;
	rep(k, 2) {
		int w = W[k] * 2, x = red((m >> k & 1 ? w - M[k] : M[k]) - H[k], w), a, g;
		a = exgcd(red(V[k] / s, w), w, g);
		if(x % g) return 0;
		w /= g;
		a = (ll)red(a, w) * (x / g) % w;
		int t = exgcd(n % w, w, g);
		if((b - a) % g) return 0;
		int m = w / g, h = red((a - b) / g % m * t % m, m);
		b += n * h;
		n *= m;
	}
	return b <= (ll)D * s;
}

int main() {
	int Q;
	scanf("%d", &Q);
	rep(ii, Q) {
		cin >> W[0] >> W[1] >> D >> M[0] >> M[1] >> H[0] >> H[1] >> V[0] >> V[1];
		exgcd(abs(V[0]), abs(V[1]), s);
		bool ans = false;
		rep(m, 4) ans |= f(m);
		puts(ans ? "Hit" : "Miss");
	}
	return 0;
}