The first line of the input contains an integer $T$ ($1 \le T \le 100$), indicating the number of test cases.
For each test case, the first line contains an integer $n$ ($3 \le n \le 10^5$), indicating the number of vertices of the convex polygon.
Each of the next $n$ lines contains two integers $x,y$ ($|x|,|y|\le 10^9$), indicating that the coordinates of a vertex of the convex polygon are $(x,y)$. The vertices are given in counterclockwise order, and there are no three vertices collinear.
The next line contains an integer $m$ ($1 \le m \le 10^5$), indicating the number of pins.
Each of the next $m$ lines contains two integers $x,y$ ($|x|,|y|\le 10^9$), indicating that the coordinates of a pin are $(x,y)$. It is guaranteed that the pins are located strictly at the outside of the polygon.
The next line contains an integer $q$ ($1 \le q \le 10^5$), indicating the number of queries.
Each of the next $q$ lines contains two integers $x,y$ ($|x|,|y|\le 10^9$), indicating that the direction vector of the bowling ball's motion is $(x,y)$. It's guaranteed that $(x,y)\neq (0,0)$.
It is guaranteed that $\sum n$, $\sum m$, and $\sum q$ over all test cases do not exceed $2\times10^5$.