Akash has two favorite convex polygons and . But one of his new year resolution for 2020 is to have only one favorite polygon (not necessarily convex). So, he is in a dilemma and has given you the task to somehow merge these two polygons. Having received such a task, the first thing that came to your mind is to choose a point and rotate the polygon , degrees counter-clockwise with respect to . After the rotation, you are hoping that the new polygon and will become one connected region, and this connected region will be Akash's new favorite polygon. Formally speaking, you are hoping that and will have a non-empty intersection.
Of course, choosing any random will not get you this result. Still, there are many valid choices for , in fact, all such choices form a bounded measurable shape (locus as a geometer would call it). So before choosing a and rotating the polygon, you decide to find the area of this shape/locus.
In the first line number of test cases () is given. Each test case starts with a line containing (). Next, two polygons and will be described. For each polygon, the first line contains the number of points (), next lines will contain coordinates () of the points. All input numbers will be integers. The points will be in counter-clockwise order. Note that the polygons are not necessarily strictly convex i.e. internal angles can be degrees but not more.
For each test case, output the area of the locus of P in a single line. Your answer will be considered correct if the relative or absolute difference is less than . That is, if your answer is and jury's answer is , your answer will be considered correct if .
1 90 4 0 0 2 0 2 2 0 2 4 3 3 5 3 5 5 3 5
In the pictures below, the blue square is polygon A, red squares are B and B'. The green shape is the locus of P. note that when P is inside it, B' and A have a non-empty intersection. But when P is outside the green area, B' and A do not intersect.