There are points.

You will be given queries. Each query will give you several points. You must answer the area of the convex hull of these points merged with the initial points.

输入描述:

This problem contains multiple test cases.

The first line contains an integer   — the number of test cases.

For each test case:

The first line contains an integer   — the number of the initial points.

Then  lines follow. The -th of them contains two integers  — the coordinate of the -th initial point.

The next line contains an integer   — the number of queries.

Then  queries follow. For each query: the first line contains an integer  — the number of points in this query; then  lines follow, the -th of which contains two integers  — the coordinate of the -th point in this query.

It is guaranteed that in all test cases, the sum of N is no more than , and the sum of  is no more than .

输出描述:

For each query in each test case, output  in one line.  indicates the area in this query.

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
3
0 3
0 4
1 5

39