当前没有测试数据。

C - Counting 2

Score : $300$ points

Problem Statement

There is a class with $N$ students. The height of the $i$-th student $(1 \leq i \leq N)$ is $A_i$.

For each $j=1,2,\ldots,Q$, answer the following question.

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

Constraints

• $1 \leq N,Q \leq 2 \times 10^5$
• $1 \leq A_i \leq 10^9$
• $1 \leq x_j \leq 10^9$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$ $Q$

$A_1$ $A_2$ $\ldots$ $A_N$

$x_1$

$x_2$

$\vdots$

$x_Q$

Output

Print $Q$ lines.

The $j$-th line $(1 \leq j \leq Q)$ should contain the number of students with a height of at least $x_j$.

3 1
100 160 130
120

2

The students with a height of at least $120$ are the $2$-nd and $3$-rd ones.

5 5
1 2 3 4 5
6
5
4
3
2

0
1
2
3
4

5 5
804289384 846930887 681692778 714636916 957747794
424238336
719885387
649760493
596516650
189641422

5
3
5
5
5