Given an array of $n$ numbers, sorted in non-decreasing order, and $k$ queries. 
For each query, print the minimum index of an array element not less than the given one.

The first line of the input contains integers $n,\ k\ (0<n,\ k≤10^5)$, the length of the array and the number of queries. 
The second line contains $n$ elements of the array, sorted in non-decreasing order. 
The third line contains $k$ queries. All array elements and queries are integers, each of which does not exceed $2⋅10^9$ in absolute value.

For each of the $k$ queries, print the minimum index of an array element not less than the given one. If there are none, print $n+1$.