Almost Clear

A museum displays many valuable objects and installs surveillance cameras so that every object can be watched. Your task is to check a single camera against a single obstacle.

In the 2-D plane you are given a convex polygon $A$ (the valuable object), a convex polygon $B$ (another object), and a point $C$ (the camera). Determine how much of polygon $A$ is hidden by polygon $B$ when the camera is placed at $C$.

Assumptions:

1. All coordinates lie in the 2-D plane.
2. Polygons $A$ and $B$ are both convex.
3. The camera has infinite range (it can see arbitrarily far).
4. The camera can rotate freely through a full 360°.
5. The camera cannot move away from point $C$.
6. Every position is valid: the two polygons do not intersect, and the camera is never inside either polygon.

A point $p$ of polygon $A$ is hidden when the straight segment from $C$ to $p$ passes through polygon $B$. Depending on how much of $A$ is hidden, decide whether $A$ is fully visible, partially hidden, or completely hidden.

The first line contains an integer $T$ ($1 \le T \le 1000$), the number of test cases.

Each test case consists of three lines:

• The first line describes polygon $A$: an integer $M_1$ ($1 \le M_1 \le 1000$), the number of vertices, followed by $M_1$ coordinate pairs $x\ y$ listing the vertices in counter-clockwise order.
• The second line describes polygon $B$ in exactly the same format.
• The third line contains two integers: the $x$- and $y$-coordinates of the camera $C$.

All coordinates are non-negative and smaller than $2^{31}$.

For each test case, print exactly one line:

• CLEAR if polygon $A$ is not obstructed by polygon $B$ at all;
• ALMOST CLEAR if polygon $A$ is only partially obstructed by polygon $B$;
• NO VISION if polygon $A$ is completely hidden by polygon $B$.