#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define RREP(i, n)          for(int(i)=(n)-1;(i)>=0;--(i))

const int MOD = (int)(1e9+9);

typedef complex<ll> P;

ll gcd(ll n, ll m){return m?gcd(m,n%m):n;}
ll lcm(ll n, ll m){return n/gcd(n,m)*m;}

bool solve(){
    ll W,H,D,Mx,My,Hx,Hy,Vx,Vy;
    cin >> W>>H>>D>>Mx>>My>>Hx>>Hy>>Vx>>Vy;
    ll g = gcd(abs(Vx),abs(Vy));
    D*=g;Vx/=g,Vy/=g;
    D = min(D,(W+1)*(H+1)*5);

    REP(i,D+1){
        Hx += Vx, Hy += Vy;
        while(1){
            if(Hx < 0){ Hx = -Hx; Vx = -Vx; continue; }
            if(Hy < 0){ Hy = -Hy; Vy = -Vy; continue; }
            if(Hx > W){ Hx = 2*W-Hx; Vx = -Vx; continue; }
            if(Hy > H){ Hy = 2*H-Hy; Vy = -Vy; continue; }
            break;
        }
        //cerr << Hx << "," << Hy << endl;
        if(Mx==Hx&&My==Hy) return true;
    }
    return false;
}

int main(){
    int Q;
    cin >> Q;
    REP(i,Q){
       cout << (solve()?"Hit":"Miss") << endl;
    }
    return 0;
}