#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

bool visited[32][32];

int main()
{
    int q;
    cin>>q;
    FOR(i,q){
        int w,h,d,mx,my,hx,hy,vx,vy;
        scanf("%d%d%d%d%d%d%d%d%d", &w,&h,&d,&mx,&my,&hx,&hy,&vx,&vy);
        memset(visited , 0 , sizeof(visited));
        int g = __gcd(abs(vx), abs(vy));
        vx /= g;
        vy /= g;
        d *= g;
        bool ok = false;
        FOR(t,d){
            hx += vx;
            hy += vy;
            hx = (hx + w * 1024) % (2 * w);
            hy = (hy + h * 1024) % (2 * h);
            if(visited[hy][hx]) break;
            visited[hy][hx] = true;
            if((hx == mx || hx == (2 * w - mx)) &&
               (hy == my || hy == (2 * h - my))){
                ok = true;
                break;
            }
        }
        puts(ok ? "Hit": "Miss");
    }
    return 0;
}