It's time to start dash!!

As a LLer, Kris loves dashing and he wants everyone to enjoy the interest of dashing. Kris can dash towards someone and pick him up so that they will dash together, forming a ray. If Kris hits the wall after he picks someone up, they will both enjoy the interest of dashing. For some secret reason, the walls now form a convex hull and Kris can only start dashing form an arbitary point in a triangle outside the polygon. Now Kris wants you to calculate the area of points that he can enjoy dashing with.

Formally, there's a convex hull. You will be given queries. Each query will give you a triangle ( maybe degenerated ), which is strictly outside the polygon. You must answer the area of points which satisfy the condition:

1.The point is strictly outside the polygon.

2. There exists a point in the triangle, the ray from to this point intersects with the convex hull but the segment from to this point does not.

This problem contains multiple test cases.

The first line contains an intger  indicates the number of test cases.

For each test case, the frist line contains one intger   indicating the number of points in the convex hull.

The next  lines each contains two integers   which means the coordinate of the -th point.

It's garanteed that the points will be given in the order to form the polygon and in counter-clockwise.

Then you will be given an integer   indicating the number of queries.

The next  lines each contains six integers   which means the coordinates of the points of the triangle.

It's guaranteed that the sum of  is no more than .

For each query, print the answer  in one line.  indicates the area of points meets the condition.

It can be proved that  is always an integer.

1
8
-1 2
-2 1
-2 -1
-1 -2
1 -2
2 -1
2 1
1 2
1
0 3 0 4 1 5

11