// Arup Guha
// 10/7/2015
// Solution to 2002 UCF HS Contest Problem: Conflicting Conferences

import java.util.*;

public class schedule {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int numCases = Integer.parseInt(stdin.nextLine().trim());

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

			// Store events by frequency for each hour.
			String name = stdin.nextLine();
			int[] events = new int[24];
			int numEvents = Integer.parseInt(stdin.nextLine().trim());

			// Process each event.
			for (int i=0; i<numEvents; i++) {

				StringTokenizer tok = new StringTokenizer(stdin.nextLine());
				int start = Integer.parseInt(tok.nextToken());
				int end = Integer.parseInt(tok.nextToken());

				// Add occupancy for this event for each hour it's occurring.
				for (int j=start; j<end; j++)
					events[j]++;
			}

			// Room header
			System.out.println(name);

			// Easy case.
			if (okay(events))
				System.out.println("SCHEDULE OK!");

			// Print out all offending hours.
			else {
				System.out.print("CONFLICTS AT ");
				for (int i=0; i<events.length; i++)
					if (events[i] > 1)
						System.out.print(i+"-"+(i+1)+" ");
				System.out.println();
			}
			System.out.println();
		}
	}

	// Returns true iff events[i] <= 1 for all i.
	public static boolean okay(int[] events) {
		for (int i=0; i<events.length; i++)
			if (events[i] > 1)
				return false;
		return true;
	}
}