Point Separation

There are several black points and white points on a plane. You want to draw an infinitely long straight line to separate the white points from the black points. The line must not pass through any point. Of the two groups divided by the line, one group must contain only white points and the other only black points.

In the figure below, the leftmost example can have its two kinds of points divided by the dashed line, but the remaining examples cannot be separated by any line.

Given the coordinates of the white and black points, write a program that determines whether the points can be separated by a straight line.

The first line contains the number of test cases $T$. The first line of each test case contains the number of black points $n$ and the number of white points $m$, separated by a space. Both $n$ and $m$ are at most $100$. The following $n$ lines contain the coordinates of the black points, separated by spaces, and the next $m$ lines contain the coordinates of the white points.

The $x$ and $y$ coordinates of every point are integers between $0$ and $10000$, inclusive. Also, no two points are at the same position.

For each test case, print YES if the points can be separated by a line as described, and NO otherwise.