import java.io.*; import java.math.*; import java.util.*; public class Main_yukicoder62 { private static Scanner sc; private static Printer pr; private static void solve() { int q = sc.nextInt(); for (int tcase = 0; tcase < q; tcase++) { long w = sc.nextInt(); long h = sc.nextInt(); long d = sc.nextInt(); long mx = sc.nextInt(); long my = sc.nextInt(); long hx = sc.nextInt(); long hy = sc.nextInt(); long vx = sc.nextInt(); long vy = sc.nextInt(); if (vx < 0) { vx = -vx; mx = w - mx; hx = w - hx; } if (vy < 0) { vy = -vy; my = h - my; hy = h - hy; } if (isHit(vx, vy, hx, hy, mx, my, w, h, d) || isHit(vx, vy, hx, hy, w + w - mx, my, w, h, d) || isHit(vx, vy, hx, hy, mx, h + h - my, w, h, d) || isHit(vx, vy, hx, hy, w + w - mx, h + h - my, w, h, d)) { pr.println("Hit"); } else { pr.println("Miss"); } } } private static boolean isHit(long vx, long vy, long hx, long hy, long mx, long my, long w, long h, long d) { // long x = (long)2 * w * vy; // long y = (long)2 * h * vx; // long z = (long)vx * (my - hy) - (long)vy * (mx - hx); BigInteger bx = BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(BigInteger.valueOf(vy)); BigInteger by = BigInteger.valueOf(2).multiply(BigInteger.valueOf(h)).multiply(BigInteger.valueOf(vx)); BigInteger bz = BigInteger.valueOf(vx).multiply(BigInteger.valueOf(my).subtract(BigInteger.valueOf(hy))).subtract(BigInteger.valueOf(vy).multiply(BigInteger.valueOf(mx).subtract(BigInteger.valueOf(hx)))); // long[] ab = new long[2]; // long gcd = extgcd(x, y, ab); // if (z % gcd != 0) { // return false; // } BigInteger[] bab = new BigInteger[2]; BigInteger bgcd = bextgcd(bx, by, bab); if (bz.mod(bgcd).compareTo(BigInteger.ZERO) != 0) { return false; } // long mul = z / gcd; BigInteger bmul = bz.divide(bgcd); // ab[0] *= mul; // ab[1] *= mul; // x /= gcd; // y /= gcd; bab[0] = bab[0].multiply(bmul); bab[1] = bab[1].multiply(bmul); bx = bx.divide(bgcd); by = by.divide(bgcd); // BigInteger n = BigInteger.valueOf(Long.MIN_VALUE); // if (bx.compareTo(BigInteger.ZERO) != 0) { // n = n.max(BigInteger.valueOf(hy).subtract(BigInteger.valueOf(my)).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(h).multiply(bab[1]))).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(h).multiply(bx).subtract(BigInteger.ONE))).divide(BigInteger.valueOf(2).multiply(BigInteger.valueOf(h)).multiply(bx))); // } // if (by.compareTo(BigInteger.ZERO) != 0) { // n = n.max(BigInteger.valueOf(hx).subtract(BigInteger.valueOf(mx)).subtract(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w).multiply(bab[0]))).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w).multiply(by).subtract(BigInteger.ONE))).divide(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(by))); // } long l = -4_000_000_000_000_000_000L; long r = 4_000_000_000_000_000_000L; while (r - l > 1) { long mid = l + (r - l) / 2; // long mdx = mx + 2 * w * (ab[0] + y * mid) - hx; // long mdy = my + 2 * w * -(ab[1] - x * mid) - hy; BigInteger mdx = BigInteger.valueOf(mx).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(bab[0].add(by.multiply(BigInteger.valueOf(mid))))).subtract(BigInteger.valueOf(hx)); BigInteger mdy = BigInteger.valueOf(my).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(h)).multiply(bab[1].negate().add(bx.multiply(BigInteger.valueOf(mid))))).subtract(BigInteger.valueOf(hy)); // if (ab[0] + y * mid >= 0 && ab[1] - x * mid >= 0) { // if (mdx >= 0 && mdy >= 0) { if (mdx.compareTo(BigInteger.ZERO) >= 0 && mdy.compareTo(BigInteger.ZERO) >= 0) { r = mid; } else { l = mid; } } // if (n.compareTo(BigInteger.valueOf(r)) != 0) { // pr.printf("differ %s %s\n", n, r); // r = n.longValue(); // } BigInteger mdx = BigInteger.valueOf(mx).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(bab[0].add(by.multiply(BigInteger.valueOf(r))))).subtract(BigInteger.valueOf(hx)); BigInteger mdy = BigInteger.valueOf(my).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(h)).multiply(bab[1].negate().add(bx.multiply(BigInteger.valueOf(r))))).subtract(BigInteger.valueOf(hy)); // BigInteger min = mdx.divide(BigInteger.valueOf(vx)).min(mdy.divide(BigInteger.valueOf(vy))); // for (long i = r + 1; i < r + 1000000; i++) { // BigInteger mdxtmp = BigInteger.valueOf(mx).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(bab[0].add(by.multiply(BigInteger.valueOf(i))))).subtract(BigInteger.valueOf(hx)); // BigInteger mdytmp = BigInteger.valueOf(my).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(bab[1].negate().add(bx.multiply(BigInteger.valueOf(i))))).subtract(BigInteger.valueOf(hy)); // BigInteger mintmp = mdxtmp.divide(BigInteger.valueOf(vx)).min(mdytmp.divide(BigInteger.valueOf(vy))); // // if (mintmp.compareTo(min) <= 0) { // min = mintmp; // mdx = mdxtmp; // mdy = mdytmp; // } else { // break; // } // } // return r; // ab[0] = r * y + ab[0]; // ab[1] = r * (-x) + ab[1]; // long mdx = mx + 2 * w * ab[0] - hx; // long mdy = my + 2 * w * -ab[1] - hy; // BigInteger mdx = BigInteger.valueOf(mx).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(bab[0].add(by.multiply(BigInteger.valueOf(r))))).subtract(BigInteger.valueOf(hx)); // BigInteger mdy = BigInteger.valueOf(my).add(BigInteger.valueOf(2).multiply(BigInteger.valueOf(w)).multiply(bab[1].negate().add(bx.multiply(BigInteger.valueOf(r))))).subtract(BigInteger.valueOf(hy)); // if (mdx < 0 || mdx > (long)d * vx) { if (mdx.compareTo(BigInteger.ZERO) < 0 || mdx.compareTo(BigInteger.valueOf(d).multiply(BigInteger.valueOf(vx))) > 0) { return false; } // if (mdy < 0 || mdy > (long)d * vy) { if (mdy.compareTo(BigInteger.ZERO) < 0 || mdy.compareTo(BigInteger.valueOf(d).multiply(BigInteger.valueOf(vy))) > 0) { return false; } return true; } private static BigInteger bextgcd(BigInteger n, BigInteger m, BigInteger[] xy) { if (m.compareTo(BigInteger.ZERO) == 0) { xy[0] = BigInteger.ONE; xy[1] = BigInteger.ZERO; return n; } else { BigInteger ret = bextgcd(m, n.mod(m), xy); BigInteger tmp = xy[1]; xy[1] = xy[0].subtract(n.divide(m).multiply(tmp)); xy[0] = tmp; return ret; } } /* private static long extgcd(long n, long m, long[] xy) { if (m == 0) { xy[0] = 1; xy[1] = 0; return n; } else { long ret = extgcd(m, n % m, xy); long tmp = xy[1]; xy[1] = xy[0] - n / m * tmp; xy[0] = tmp; return ret; } } */ // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }