Annoying Mosquitos

Lee wants to go to sleep, but there are mosquitos on the wall of his room. He knows that the moment he is about to doze off they will rush in to bite him, just as they have on the past several nights. Valuing a good night's sleep above all, he decides enough is enough and grabs his fly swatter.

Unfortunately, Lee is completely blind, which is a real disadvantage when it comes to swatting. The mosquitos seem to grasp this and hold perfectly still so as not to trigger his sharp hearing. Lee has no choice but to strike the wall at random, but luckily his fly swatter is quite large: each swat kills every mosquito inside a $101 \times 101$ square area.

The square of a swat extends $50$ units in each direction from the swat's midpoint. In other words, a swat centered at $(x_j, y_j)$ kills a mosquito at $(x_i, y_i)$ whenever $|x_i - x_j| \le 50$ and $|y_i - y_j| \le 50$. A mosquito that is hit at least once counts as hit, and is counted only once even if several swats reach it.

For each test case, determine how many mosquitos get hit.

The first line contains one positive integer: the number of test cases (at most $100$). Then, for each test case:

• one line with an integer $n$ ($1 \le n \le 100$): the number of mosquitos on the wall.
• $n$ lines, each with two space-separated integers $x_i$ and $y_i$ ($-1000 \le x_i, y_i \le 1000$): the position of the $i$-th mosquito. All positions are distinct.
• one line with an integer $m$ ($1 \le m \le 10000$): the number of swats Lee attempts.
• $m$ lines, each with two space-separated integers $x_j$ and $y_j$ ($-1000 \le x_j, y_j \le 1000$): the midpoint of the $j$-th swat.

For each test case, output one line with the number of mosquitos that get hit.