// Sarah Buchanan
// 7/26/10
// Solution for 2010 BHCSI programming Contest.
// 2D Rectangle Collision problem.

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

public class collision {

	public static void main(String[] args) throws IOException {

		Scanner fin = new Scanner(new File("collision.in"));

		// Read in the number of input cases.
		int numcases = fin.nextInt();

		// Loop through each case.
		for (int cnt=0; cnt < numcases; cnt++) {

			// Read each object's position and dimensions
			int object1X = fin.nextInt();
			int object1Y = fin.nextInt();
			int object1W = fin.nextInt();
			int object1H = fin.nextInt();

			int object2X = fin.nextInt();
			int object2Y = fin.nextInt();
			int object2W = fin.nextInt();
			int object2H = fin.nextInt();


			// Determine if the 2 objects intersect
			if (object1X + object1W > object2X &&
				object1X < object2X + object2W &&
				object1Y + object1H > object2Y &&
				object1Y < object2Y + object2H)
			{
				System.out.println("Case #" + (cnt + 1) + ": Object 1 COLLIDES with Object 2.");
			}
			else
			{
				System.out.println("Case #" + (cnt + 1) + ": Object 1 DOES NOT COLLIDE with Object 2.");
			}
		}
	}

}