// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

bool vis[20][20][4];

int dir(int x, int y){
  if(x > 0){
    if(y > 0)return 0;
    else return 1;
  }else{
    if(y > 0)return 2;
    else return 3;
  }
}

P nv(int x, int y, int k){
  if(k == 0){
    x = abs(x), y = abs(y);
  }else if(k == 1){
    x = abs(x), y = - abs(y);
  }else if(k == 2){
    x = - abs(x), y = abs(y);
  }else{
    x = - abs(x), y = - abs(y);
  }
  return mk(x, y);
}

int w, h, d, mx, my, vx, vy, hx, hy;
int cnt;

void dfs(int i, int j, int k){
  if(cnt < 0)return;
  cnt--;
  if(vis[i][j][k])return;
  vis[i][j][k] = true;
  int X = i + vx;
  int Y = j + vy;
  X %= 2 * w;
  Y %= 2 * h;
  if(X < 0){
    vx *= -1;
    X *= -1;
  }
  if(X > w){
    vx *= -1;
    X = w - (X - w);
  }
  if(Y < 0){
    vy *= -1;
    Y *= -1;
  }
  if(Y > h){
    vy *= -1;
    Y = h - (Y - h);
  }
  dfs(X, Y, dir(vx, vy));
}

template<typename T>
T gcd(T a, T b) {
  if(a > b)return gcd(b, a);
  if(a == 0)return b;
  return gcd(b % a, a);
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int q;
  cin >> q;
  rep(i_, q){
    cin >> w >> h >> d >> mx >> my >> hx >> hy >> vx >> vy;
    int tmp = gcd(abs(vx), abs(vy));
    vx /= tmp, vy /= tmp;
    d *= tmp;
    rep(i, w+1){
      rep(j, h+1){
        rep(k, 4)vis[i][j][k] = false;
      }
    }
    cnt = d;
    dfs(hx, hy, dir(vx, vy));
    bool ok = false;
    rep(k, 4){
      ok |= vis[mx][my][k];
    }
    if(ok)cout << "Hit" << endl;
    else cout << "Miss" << endl;
  }
	return 0;
}