Delicious Apples

There are $N$ apples numbered 1 through $N$. The taste of apple $i$ is $t_i$, and its size is $s_i$.

You must answer $Q$ queries. Each query gives an integer $p$, and you must print the number of apples with the largest size $s_i$ among those whose taste $t_i$ is at least $p$. If no apple satisfies the condition, print 0.

The first line contains $N$ and $Q$, separated by a space.

The second line contains the tastes $t_1, t_2, \dots, t_N$, separated by spaces.

The third line contains the sizes $s_1, s_2, \dots, s_N$, separated by spaces.

Each of the next $Q$ lines contains one integer $p$.

Print $Q$ lines. For each $p$, print the number of apples with the largest size among those with taste $t_i$ at least $p$, one per line, in order.

• $1 \le N, Q \le 200\,000$
• $1 \le t_i, s_i \le 1\,000\,000\,000$
• $1 \le p \le 1\,000\,000\,000$