# Problem M

Skilaboð

Languages
en
is
## Input

The input begins with a line with a single integer $N$. Next there are $N$ lines with two integers each, $x_i$ and $y_i$, where the values in line $i$ denotes the location of person $i$, $|x_i|, |y_i| \leq 10^9$. Then there is a line with a single integer $Q$. Finally there are $Q$ lines, each with one integer $d_i$ where $d_i$ is the power of transmitter $i$, $0 \leq d_i \leq 10^9$.

## Output

$Q$ lines with one integer each, the value in line $i$ giving how many people would receive the message if transmitter $i$ were used.

## Scoring

Group |
Points |
Constraints |

1 |
50 |
$1 \leq N, Q \leq 1000$ |

2 |
50 |
$1000 < N, Q \leq 10^5$ |

Sample Input 1 | Sample Output 1 |
---|---|

5 1 1 2 2 3 2 2 3 4 6 3 1 2 3 |
0 1 2 |

Sample Input 2 | Sample Output 2 |
---|---|

4 -1 10 45 29 -499 -142 599 -10 5 1 29 142 599 1000 |
0 1 2 3 4 |