Multi test cases (about $15$).
For each case, first line contains two integers $N$ and $Q$ separated by exactly one space, N indicates there are $N$ trees, $Q$ indicates there are $Q$ queries.
In the following $N$ lines, there will appear $h[1],h[2],h[3],…,h[N]$ which indicates the height of the trees.
In the following $Q$ lines, there will appear $q[1],q[2],q[3],…,q[Q]$ which indicates CodeFamer’s queries.
Please process to the end of file.
[Technical Specification]
$1 \leq N,Q \leq 50000$
$0 \leq h[i] \leq 1000000000(10^{9})$
$0 \leq q[i] \leq 1000000000(10^{9})$