There are $N$ bubbles in a coordinate plane. Bubbles are so tiny that it can be assumed that each bubble is a point $(X_i, Y_i)$.

$Q$ Bubble Cup finalists plan to play with the bubbles. Each finalist would link to use infinitely long Bubble Cup stick to pop some bubbles. The $i$-th finalist would like to place the stick in the direction of vector $(dxi, dyi)$, and plays the following game until $K_i$ bubbles are popped. The game starts with finalist placing the stick in the direction of vector $(dx_i, dy_i)$, and sweeping it from the infinity to the left until it hits some bubble, which is immediately popped. It is guaranteed that only one bubble will be hit in this step. After that the finalist starts rotating the stick in the counter clockwise direction with the center of rotation in point where the previous bubble was popped. When the next bubble is hit, it is immediately popped and becomes the new center of rotation. The process continues until $K_i$ bubbles have been popped. It is guaranteed that the stick won't hit two bubbles simultaneously in this process.

For each finalist find which bubble would be popped the last. Note that each game starts with the configuration of all $N$ bubbles, so the games don't depend on the previous games.

The first line contains one integer $N$ — the number of bubbles. ($1 \leq N \leq 10^5$)

Each of the next $N$ lines contains two integers. The $i$-th line contains integers $X_i$ and $Y_i$ — the coordinates of the $i$-th bubble. ($-10^9 \leq X_i, Y_i \leq 10^9$, $(X_i, Y_i) \neq (X_j, Y_j)$ for $i \neq j$)

The next line contains one integer $Q$ — the number of finalists willing to play with the bubbles. ($1 \leq Q \leq 10^5$)

Each of the next Q lines contains 3 integers. The $i$-th line contains integers $dx_i$, $dy_i$ and $K_i$. ($-10^9 \leq dx_i, dy_i \leq 10^9$, $1 \leq K_i \leq N$)

For each of the $Q$ finalists, print the index of the bubble which would be popped last, in the separate line.