Counting points inside a circle

There are $N$ points on the two-dimensional coordinate plane. Write a program that answers the following query.

• x y r: print how many points lie inside the circle centered at $(x, y)$ with radius $r$. A point on the circumference counts as inside.

In other words, a point $(a, b)$ is counted when $(a - x)^2 + (b - y)^2 \le r^2$.

Two or more points can share the same coordinate, and each of them is counted separately. A query never adds or removes a point, so the order in which the queries are processed does not change any answer.

The first line contains the number of points $N$ ($1 \le N \le 100\,000$).

Each of the next $N$ lines contains the coordinates $x$ and $y$ of one point, separated by a space ($0 \le x, y \le 1\,000\,000$).

The next line contains the number of queries $M$ ($1 \le M \le 100\,000$).

Each of the next $M$ lines contains one query as $x$, $y$, $r$, separated by spaces ($0 \le x, y \le 1\,000\,000$, $1 \le r \le 1\,000\,000$).

Every number in the input is an integer.

For each query, print the number of points inside the circle on its own line, in the order the queries are given.