### ACM-ICPC INC 2008 Final Round

## Problem C

# Almost Clear

Time Limit: 5s

In ACM (Awkward Commodity Museum), like every other museum, collects many valuable objects from every place around the globe, therefore several surveillance cameras are installed to watch over the museum for possible unauthorized access. In order to assure maximum surveillance, Mr. Effendy as the Head Security of ACM proposed such layout that all valuable objects being displayed must be visible from one of the cameras.
In ACM, Mr. Halim from the QCD (Quality Control Department) is in charge to verify the layout Mr. Effendy proposed. Usually he develops program to help him do the verifying process, but he is currently busy helping some public forum to understand about Binary Search Tree and the likes of which a programmer like you should already mastered. You should help Mr. Halim before he’s fired because stealing company’s hour to do things irrelevant to his position.
Mr. Halim is asked to write a program that accepts a layout, and verify that all valuable objects are visible by at least one of the camera installed. You must help him! Mr. Halim is a very brilliant guy; he doesn’t require you to write a complete solution. Write a program that receives 3 parameters: polygon A, polygon B, point C and determine whether polygon A (the valuable object) is “hidden” by polygon B (other object) when a camera is installed at point C. Note that your program is only need to deal with these 3 objects and nothing more, Mr. Halim will do the rest.
You may safely assume that:

1. Your program deals in 2-D coordinates.
2. Polygon A and B is convex.
3. The camera has infinite vision (meaning that it can see an object very far away).
4. The camera can rotate 360 degrees freely.
5. The camera cannot move.
6. All position will be valid. Polygons do not intersect each other; camera will not be inside any of the polygons.
7. All the characters and events described above are fictional. Any similarity of names of the characters and events is partially accidentally. No polygons were harmed during the making of this problem.

### Input

The first line of input contains an integer T (1 <= T <= 1,000), the number of test cases follow.
Each case begins with an integer M1 (1 <= M1 <= 1,000), the number of vertices of polygon A, and then followed by M1 integer-pairs which are the X-coordinate and Y-coordinate of each vertex in counter-clockwise direction. The second line will be the description of polygon B in the same format and constraint as the description of polygon A. The third line will be 2 integers which are the X-coordinate and Y-coordinate of the camera respectively. All coordinates will be non-negative and fit in 31-bit integer.

### Output

Output for each test case will be in one line. Print "CLEAR" if polygon A is not obstructed by polygon B at all, print "ALMOST CLEAR" if polygon A is obstructed partially by polygon B, or print "NO VISION" if polygon A is fully hidden by polygon B.

Sample Input | Output for Sample Input
--- | ---
    3
    3 5 23 24 23 16 36
    4 0 10 5 10 5 20 0 20
    0 0
    4 22 53 34 53 34 63 22 63
    4 18 31 38 31 38 46 18 46
    26 0
    4 36 38 48 38 48 48 36 48
    4 28 16 51 16 51 30 28 30
    20 57
    ALMOST CLEAR
    NO VISION
    CLEAR