Infection Simulation

EGOI cafeteria had $N$ customers yesterday. Customers are numbered from $1$ to $N$. Customer $i$ ($1 \le i \le N$) entered at time $L_i$ and left at time $R_i$. Today it was found that one customer came in already infected with the new strain of disease X that is currently spreading in JOI Country.

The infection resistance of disease X is an integer $x$. Specifically, for each $1 \le i \le N$, customer $i$ becomes a new infected person as soon as the total time customer $i$ spends in the cafeteria together with at least one infected person reaches $x$ or more.

JOI Country enforces strict infection control, so the number of infected people must be tracked accurately. However, no one knows who was infected with disease X, and the value of $x$ is unknown.

Ms. Rie, the manager of the EGOI cafeteria, wants the final number of infected customers for each of $Q$ scenarios. In the $j$-th scenario ($1 \le j \le Q$), customer $P_j$ is the only initial infected person, and the infection resistance of disease X is $X_j$.

Given the customer and scenario information, write a program that prints the final number of infected customers for each scenario. A customer infected at exactly their leave time is counted. A customer who has become infected never stops being infected.

The input is given in the following format.

N
L1   R1
L2   R2
︙
LN   RN
Q
P1   X1
P2   X2
︙
PQ   XQ

Print $Q$ lines. On line $j$ ($1 \le j \le Q$), print the final number of infected customers in the $j$-th scenario.

• $1 \le N \le 100000$.
• $0 \le L_i < R_i \le 10^9$ ($1 \le i \le N$).
• $1 \le Q \le 100000$.
• $1 \le P_j \le N$ ($1 \le j \le Q$).
• $1 \le X_j \le 10^9$ ($1 \le j \le Q$).
• All input values are integers.