B. Queries about less or equal elements
binary search; data structures; sortings; two pointers
You are given two arrays of integers a and b. For each element of the second array bj you should find the number of elements in array a that are less than or equal to the value bj.
The first line contains two integers n, m (1 ≤ n, m ≤ 2·105) — the sizes of arrays a and b.The second line contains n integers — the elements of array a ( - 109 ≤ ai ≤ 109).The third line contains m integers — the elements of array b ( - 109 ≤ bj ≤ 109).
Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value bj.