import java.io.*;
import java.util.*;


public class Main_yukicoder61 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int q = sc.nextInt();

		for (int tcase = 0; tcase < q; tcase++) {
			int w = sc.nextInt();
			int h = sc.nextInt();
			int d = sc.nextInt();
			int mx = sc.nextInt();
			int my = sc.nextInt();
			int hx = sc.nextInt();
			int hy = sc.nextInt();
			int vx = sc.nextInt();
			int 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");
			}
			pr.flush();
		}
	}

	private static boolean isHit(int vx, int vy, int hx, int hy, int mx, int my, int w, int h, int d) {
		long x = (long)2 * w * vy;
		long y = (long)2 * h * vx;
		long z = (long)vx *(my - hy) - (long)vy * (mx - hx);

		long[] ab = new long[2];
		long gcd = extgcd(x, y, ab);
		if (z % gcd != 0) {
			return false;
		}

		long mul = z / gcd;
		ab[0] *= mul;
		ab[1] *= mul;
		x /= gcd;
		y /= gcd;

		long n = Long.MIN_VALUE;
		if (y != 0) {
			long tmp = (mx - hx + 2 * w * ab[0]) % (2 * w * y);
			if (tmp < 0) {
				tmp += 2 * w * y;
			}
			n = (tmp - (mx - hx + 2 * w * ab[0])) / (2 * w * y);
		}
		if (x != 0) {
			long tmp = (my - hy - 2 * h * ab[1]) % (2 * h * x);
			if (tmp < 0) {
				tmp += 2 * h * x;
			}
			long tmpn = (tmp - (my - hy - 2 * h * ab[1])) / (2 * h * x);
			if (y != 0 && tmpn != n) {
				pr.printf("err n tmpn %d %d\n", n, tmpn);
			}
			n = tmpn;
		}

		ab[0] = n * y + ab[0];
		ab[1] = n * (-x) + ab[1];

		long mdx = mx + 2 * w * ab[0] - hx;
		long mdy = my + 2 * h * -ab[1] - hy;

		if (mdx < 0 || mdx > (long)d * vx) {
			return false;
		}
		if (mdy < 0 || mdy > (long)d * vy) {
			return false;
		}

		return true;
	}

	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);
		}
	}
}