Mr. Jolly teaches football (or soccer, for US speakers) to children numbered from to . He has taken to leaving sweets on the field where the games take place, one for each child. After the game is finished, each child can grab and eat one sweet as their reward.
The children are tired after games, so each child wants to grab the sweet closest to them (using Euclidean distance). This could lead to fights — if the same sweet is closest to two or more children. To avoid that, after the game all the children stop where they are, and Mr. Jolly calls out their names, one by one. When a child's name is called, they grab the closest sweet to them (out of the ones that weren't already grabbed, of course). In the case where two or more sweets are tied for the smallest distance, Mr. Jolly can decide which one the child grabs.
This has worked very well for Mr. Jolly for a while now, but today disaster struck! While laying out the sweets, Mr. Jolly accidentally dropped his blueberry jelly that he planned to eat after all the children go home. So now there are children on the field, and sweets. The sweets are numbered from to , with sweet being Mr. Jolly's blueberry jelly. Is there a way for Mr. Jolly to save his blueberry jelly by calling the children's names in such an order that the blueberry jelly is the one sweet left over?
The first line of the input gives the number of test cases, . test cases follow. Each test begins with a line containing a single integer, , the number of children on the field. The next lines describe the positions of the children. Each of these lines contains two integers, and , representing the position of the -th child after the game ends. Then there are more lines that describe the positions of sweets after the game, where the first of the sweets is Mr. Jolly's blueberry jelly. Each of these lines contains two integers, and , representing the position of the -th sweet.
For each test case, output one line containing
Case #x: y, where is the test case number (starting from 1) and is
IMPOSSIBLE if there is no way Mr. Jolly can choose the children (and break ties for the closest sweet) to leave his blueberry jelly uneaten. Otherwise, if Mr. Jolly can save his blueberry jelly, is
POSSIBLE. If Mr. Jolly can save his jelly, output additional lines representing the order the children will go and which jellies they will pick. The -th line should contain two integers and representing that child will go next and will pick sweet . The sweet must be the closest (or tied for the closest) sweet to child when they go to pick their sweet.
Memory limit: 1 GB.
- , for all .
- , for all .
- , for all .
Test Set 1
Time limit: 10 seconds.
Test Set 2
Time limit: 45 seconds.
4 2 -3 0 -1 0 3 0 -2 -1 -2 1 1 0 0 1 1 2 2 3 10 0 -10 0 0 0 0 5 -1 0 5 0 0 -5 2 3 4 3 4 5 7 3 4 5 7
Case #1: POSSIBLE 2 2 1 3 Case #2: IMPOSSIBLE Case #3: POSSIBLE 3 2 2 4 1 3 Case #4: POSSIBLE 1 2 2 3
Sample Case #1 is illustrated in the image above. Notice that each child is equally close to each of the two non-blueberry-jelly sweets. In our solution, Mr. Jolly assigns the second sweet to the second child and the third sweet to the first child, successfully leaving the first sweet (the blueberry jelly) for himself.
In Sample Case #2, the sole child is closer to the blueberry jelly than to the other sweet, so Mr. Jolly cannot prevent his precious blueberry jelly from being eaten.
In Sample Case #3, we present one of many solutions; it is actually possible to call the children in any order.
In Sample Case #4, note that children might share the same position, sweets might share the same position, and children and sweets might share the same position.
This problem has different time limits for different batches. If you exceed the Time Limit for any batch, the judge will incorrectly display
>45.000s regardless of the actual time taken. Refer to the Limits section for batch-specific time limits.