SCUSA Region ACM Balloon Logo ICPC Masthead
2008 South Central USA Regional Programming Contest

The Screen Behind the Mirror

Introduction:

Dr. Evil has contracted your valuable services to build for him the world's most powerful "laser". Of course before you spend one billion dollars building the thing, you want to run some simulations first to make sure everything will work as designed. For this phase of the project, you will be simulating part of the aiming system which uses mirrors and other optics to change the direction of the laser beam.

The simulation consists of a flat square table with mirrors, beam splitters, and beam detectors arranged on the tabletop, and with each object represented by a one dimensional line segment. The list below describes each of the object types in detail:

See the figures below for examples of a laser beam's interaction with each of the possible object types:

Mirror Object Splitter Object Detector Object

For each simulation, a single laser beam enters the tabletop area. The program must compute the path taken by the laser beam (including secondary beams due to splitters), and it must determine which detectors are struck by a laser beam.

You can make the following assumptions in the program:

  1. The tabletop surface is a 100 by 100 square, and unless otherwise specified all coordinates in the program's input are given as integers within the tabletop area (i.e. between 0 and 100 inclusive).
  2. There will be no overlaps between the line segment objects.
  3. The laser which enters the tabletop area always starts from the edge of the table.
  4. The simulation of each data set ends when all laser beams have either exited the table top area or have terminated at a detector.
  5. For each data set there will be no more than 100 total reflections among all laser beams in that data set.
  6. A laser beam will never intersect any object on a vertex and will never be collinear with an object's line segment.
  7. Each data set will contain at least one detector object.

Input:

Input to this problem will begin with a line containing a single integer N (1 ≤ N ≤ 100) indicating the number of data sets. Each data set consists of the following components:

Output:

For each data set in the input, output the heading "DATA SET #k" where k is 1 for the first data set, 2 for the second, etc. If in this data set none of the detector objects are struck by any laser beams, output the message "NO BEAMS DETECTED". Otherwise, output the object number, one per line, of each detector struck by a laser beam. The list of detectors should be sorted by their object numbers and output in ascending order. If a detector is struck by more than one laser beam, it should only be listed once in the output.

Sample Input:

1
50,100 0,-1
6
D 0,40 20,20
M 40,20 60,40
D 80,20 100,40
D 0,70 20,90
S 40,90 60,70
D 80,90 100,70

Sample Output:

DATA SET #1
1
6