Vicinity

You are given several points in the plane. Pick one of them as the base point and count how many points lie close to it.

Let the set of points be $P = \{p_1, p_2, \dots, p_n\}$, where $p_i$ has coordinates $(x_i, y_i)$. Write $d(p_i, p_j)$ for the Euclidean distance between two points. Point $p_j$ is in the vicinity of point $p_i$ when $d(p_i, p_j) \le d_v$, and $d_v$ is called the vicinity distance.

Given the set $P$, a base point $p_i$ and a vicinity distance $d_v$, write a program that computes how many points are in the vicinity of $p_i$. The base point $p_i$ itself is not counted.

The first line contains the number of points $n$ ($2 \le n \le 1000$). Each of the next $n$ lines contains the integer coordinates $x_i$ and $y_i$ of one point ($-10^6 \le x_i, y_i \le 10^6$).

The next line contains the number of queries $t$ ($1 \le t \le 50$). Each of the following $t$ lines contains two positive integers $i$ and $d_v$ ($1 \le i \le n$, $1 \le d_v \le 100$), meaning the base point $p_i$ and its vicinity distance $d_v$.

For each query, print on its own line how many points are in the vicinity of the base point.