// Arup Guha
// 10/9/2015
// Solution to 2001 UCF HS Contest Problem: Canadian Curling

import java.util.*;

public class curling {

	// Where center ice is!
	final public static int CENTER_X = 85;
	final public static int CENTER_Y = 1512;

	// This is 78 squared, since the rock must land 78 inches from center to count.
	final public static int MAX = 6084;

    // Tolerance for two shots being equal.
	final public static double EPSILON = 0.01;

	public static void main(String[] args) {

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

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

			// Read in teams rocks.
			int[][] white = new int[8][2];
			for (int i=0; i<8; i++)
				for (int j=0; j<2; j++)
					white[i][j] = stdin.nextInt();
			int[][] black = new int[8][2];
			for (int i=0; i<8; i++)
				for (int j=0; j<2; j++)
					black[i][j] = stdin.nextInt();

			// Get each team's best rock.
			int distSqWhite = getBest(white);
			int distSqBlack = getBest(black);

			// Output result.
			if (distSqWhite > MAX && distSqBlack > MAX)
				System.out.println("Neither team scores");
			else if (Math.abs(Math.sqrt(distSqWhite) - Math.sqrt(distSqBlack)) <= EPSILON)
				System.out.println("Neither team scores");
			else if (distSqWhite < distSqBlack)
				System.out.println("White scores "+solve(white, distSqBlack));
			else
				System.out.println("Black scores "+solve(black, distSqWhite));
		}
	}


	public static int getBest(int[][] color) {

		int res = 1000000000;

		// Store closest distance squared from center point.
		for (int i=0; i<color.length; i++) {
			int sq = (color[i][0]-CENTER_X)*(color[i][0]-CENTER_X) +
				     (color[i][1]-CENTER_Y)*(color[i][1]-CENTER_Y);
			res = Math.min(res, sq);
		}

		// Return best distance.
		return res;
	}

	public static int solve(int[][] color, int distSq) {

		int res = 0;

		// Count number of items closer than distSq and the max square distance, using 0.01
		// inch "clearance" specified in the problem.
		for (int i=0; i<color.length; i++) {
			int sq = (color[i][0]-CENTER_X)*(color[i][0]-CENTER_X) +
				     (color[i][1]-CENTER_Y)*(color[i][1]-CENTER_Y);
			if (Math.sqrt(sq) < Math.sqrt(distSq)-EPSILON && sq <= MAX)
				res++;
		}

		// Return it.
		return res;
	}
}