Problem Statement

There is a class with $N$ students. The height of the $i$-th student $(1\le i\le N)$ is A_iAi.
For each $j=1,2,\dots ,Q$, answer the following question.

• How many of the $N$ students have a height of at least x_jxj?

Constraints

• 1 \leq N,Q \leq 2 \times 10^51≤N,Q≤2×105
• 1 \leq A_i \leq 10^91≤Ai≤109
• 1 \leq x_j \leq 10^91≤xj≤109
• All values in input are integers.

$N$$Q$A_1A1A_2A2$\dots$A_NANx_1x1x_2x2$⋮$x_QxQ