// Arup Guha
// 10/14/2015
// Solution to 2000 UCF HS Contest Problem: The Pool Game

import java.util.*;

public class pool {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = stdin.nextInt();

		// Process each case.
		for (int loop=1; loop<=numCases; loop++) {

			// Read in where I am and the ball.
			int[] me = new int[2];
			int[] ball = new int[2];
			for (int i=0; i<2; i++) me[i] = stdin.nextInt();
			for (int i=0; i<2; i++) ball[i] = stdin.nextInt();

			// Process each target.
			int n = stdin.nextInt();
			boolean res = false;
			for (int i=0; i<n; i++) {
				int[] target = new int[2];
				for (int j=0; j<2; j++) target[j] = stdin.nextInt();
				if (parallel(me, ball, target)) res = true;
			}

			// Print result.
			if (res) 	System.out.println("Watch out, Spike!  You're going to hit somebody!");
			else		System.out.println("Go ahead, Spike.  It looks clear.");
		}
	}

	// Just check magnitude of cross product of vectors ab and ac to see if it's 0 and makes sure AC is in the same direction
	// (not opposite) of AB.
	public static boolean parallel (int[] a, int[] b, int[] c) {
		long[] vAB = {b[0]-a[0], b[1]-a[1]};
		long[] vAC = {c[0]-a[0], c[1]-a[1]};
		return vAB[0]*vAC[1] - vAC[0]*vAB[1] == 0L && sign(vAB, vAC);
	}

	// Returns true iff the signs of v1 match v2.
	public static boolean sign(long[] v1, long[] v2) {
		for (int i=0; i<v1.length; i++)
			if ((v1[i] < 0 && v2[i] > 0) || (v1[i] > 0 && v2[i] < 0))
				return false;
		return true;
	}
}