#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>

using namespace std;

int main(){

    long long Q, W, H, D, mx, my, hx, hy, vx, vy, t, X, Y;
    cin >> Q;

    while(Q){
        cin >> W >> H >> D >> mx >> my >> hx >> hy >> vx >> vy;
        long long g;
        if (vx == 0) g = abs(vy);
        else if (vy == 0) g = abs(vx);
        else g = gcd(vx, vy);
        D *= g;
        t = min(D+1, 1025LL);
        vx /= g;
        vy /= g;
        bool f=1;
        for (int i=0; i<t; i++){
            X = ((hx+vx*i) % (W*2)+W*2) % (W*2);
            Y = ((hy+vy*i) % (H*2)+H*2) % (H*2);
            if (X > W) X = W * 2 - X;
            if (Y > H) Y = H * 2 - Y;
            if (mx == X && my == Y){
                cout << "Hit" << endl;
                f = 0;
                break;
            }
        }
        if (f) cout << "Miss" << endl;
        Q--;
    }

    return 0;
}