#include #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,j) FOR(i,0,j) #define mp std::make_pair typedef long long ll; typedef std::pair P; typedef std::pair State; State extgcd(ll a, ll b){ if(b == 0ll){ return mp(a, mp(1ll, 0ll)); } State s = extgcd(b, a%b); P p = s.second; return mp(s.first, mp(p.second, p.first-(a/b)*p.second)); } ll gcd(ll a, ll b){if(b == 0){return a;} return gcd(b, a%b);} ll norm(ll x, ll y){return x * x + y * y;} int Q; ll W, H, D, MX, MY, HX, HY, VX, VY; int main(){ std::cin >> Q; REP(i, Q){ std::cin >> W >> H >> D >> MX >> MY >> HX >> HY >> VX >> VY; if(VX < 0){ VX = -VX; MX = W - MX; HX = W - HX; } if(VY < 0){ VY = -VY; MY = H - MY; HY = H - HY; } bool can = false; if(VY == 0 && HY == MY){ if(HX < MX && MX-HX <= D * VX){can = true;} if(MX < HX && W-HX+W-MX <= D * VX){can = true;} }else if(VX == 0 && HX == MX){ if(HY < MY && MY-HY <= D * VY){can = true;} if(MY < HY && H-HY+H-MY <= D * VY){can = true;} }else{ ll cx[4] = {MX, 2ll*W-MX, MX, 2ll*W-MX}, cy[4] = {MY, MY, 2ll*H-MY, 2ll*H-MY}; REP(i, 4){ ll a = 2ll * VY * W, b = -2ll * VX * H, c = VX * (cy[i]-HY) - VY * (cx[i]-HX); if(c % gcd(a, b) != 0){continue;} State s = extgcd(a, b); ll x = s.second.first, y = s.second.second; while(x-b < 0 || y+a < 0 || cx[i]+2ll*W*(x-b) <= HX || cy[i]+2ll*H*(y+a) <= HY){x -= b; y += a;} while(x+b >= 0 && y-a >= 0 && cx[i]+2ll*W*(x+b) > HX && cy[i]+2ll*H*(y-a) > HY){ x += b; y -= a; } if(norm(cx[i]+2ll*W*x-HX, cy[i]+2ll*H*y-HY) <= D * D * norm(VX, VY)){ can = true; } } } if(can){ puts("Hit"); }else{ puts("Miss"); } } }