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

#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define var auto
#define mod 1000000007
#define inf 2147483647
#define nil -1
typedef long long ll;

using namespace std;

inline int input(){
    int a;
    cin >> a;
    return a;
}

template <typename T>
inline void output(T a, int p) {
    if(p){
        cout << fixed << setprecision(p)  << a << "\n";
    }
    else{
        cout << a << "\n";
    }
}

// end of template

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

vector<vector<int>> grid(16, vector<int>(16, 0));

bool homuracha(int W, int H, int D, int Mx, int My, int Hx, int Hy, int Vx, int Vy){
    grid.assign(16, vector<int>(16, 0));
    
    int g = gcd(abs(Vx), abs(Vy));
    D *= g, Vx /= g, Vy /= g;
    
    rep(i, min((W + 1) * (H + 1) * 4, D + 1)){
        int nHx = abs(Hx + Vx * i) % (2 * W);
        int nHy = abs(Hy + Vy * i) % (2 * H);
        if (nHx > W) nHx = 2 * W - nHx;
        if (nHy > H) nHy = 2 * H - nHy;
        // cout << Hx << " " << Hy << endl;
        grid[nHx][nHy] = 1;
    }
    
    return grid[Mx][My] ? true : false;
}

int main() {
    cin.tie(0);
    // source code
    
    int Q = input(); // queries: 10000
    int W, H, D, Mx, My, Hx, Hy, Vx, Vy;
    rep(i, Q){
        cin >> W >> H >> D >> Mx >> My >> Hx >> Hy >> Vx >> Vy;
        bool ret = homuracha(W, H, D, Mx, My, Hx, Hy, Vx, Vy);
        output(ret ? "Hit" : "Miss", 0);
    }
    
    return 0;
}