Blue x Red = Bang

The RB Company is a pioneer in manufacturing electronic boards, and it is now designing a special kind of power board. Each power board is a flat plastic plate carrying colored plugs: blue plugs are null poles and red plugs are phase poles.

The design rule requires connecting all of the blue plugs with straight segments to form a single simple polygon (the blue polygon). Its vertices must be exactly the blue plugs: every blue plug must be a vertex, and no other point may be used. The red plugs must likewise form a simple red polygon. You may assume that no three plugs of the same color are collinear (lie on one line).

For safety, the blue polygon and the red polygon must not intersect; if the two polygons share any point (their intersection is non-empty), a disastrous explosion is inevitable. Some placements of the plugs make it impossible to draw non-intersecting blue and red polygons, and such placements are called disastrous. Write a program that, for each board, decides whether non-intersecting polygons exist.

The first line contains a single integer $t$ ($1 \le t \le 5$), the number of test cases. Each test case begins with a line containing two integers $b$ and $r$ ($3 \le b, r < 10$), the number of blue and red plugs respectively. The next $b$ lines each contain two integers $x$ and $y$ giving the coordinates of a blue plug, followed by $r$ lines each containing two integers $x$ and $y$ giving the coordinates of a red plug. All coordinates are pairwise distinct and lie in the range $0$ to $100000$ inclusive.

For each test case, print a single line containing YES if non-intersecting polygons exist, or NO otherwise. The output is case-sensitive.