B. Queries about less or equal elementstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou 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.InputThe 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).OutputPrint 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.ExamplesInput5 41 3 5 7 96 4 2 8Output3 2 1 4Input5 51 2 1 2 53 1 4 1 5Output4 2 4 2 5
Input5 41 3 5 7 96 4 2 8
Output3 2 1 4
['binary search', 'data structures', 'sortings', 'two pointers', '*1300']