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.

Input

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).

Output

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.

Examples

Input

5 4
1 3 5 7 9
6 4 2 8


Output

3 2 1 4


Input

5 5
1 2 1 2 5
3 1 4 1 5


Output

4 2 4 2 5

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;

public class Solution {

	public static void main(String args[]) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s[] = br.readLine().split(" ");
		int n = Integer.parseInt(s[0]);
		int m = Integer.parseInt(s[1]);

		s = br.readLine().split(" ");
		Integer a[] = new Integer[n];

		for (int i = 0; i < n; i++)
			a[i] = Integer.parseInt(s[i]);

		Integer b[] = new Integer[m];
		int temp[] = new int[m];

		s = br.readLine().split(" ");

		for (int i = 0; i < m; i++) {
			b[i] = Integer.parseInt(s[i]);
			temp[i] = Integer.parseInt(s[i]);
		}

		Arrays.sort(a);
		Arrays.sort(b);

		MyComparator mc = new MyComparator();

		long count[] = new long[b.length];

		for (int i = 0; i < b.length; i++) {

			long cc = 0;

			int j = Arrays.binarySearch(a, b[i], mc);
			if (j >= 0) {
				long cunt = 0;
				for (int x = j + 1; x < a.length; x++)
					if (a[j] == a[x])
						cunt++;
					else
						break;

				cc = j + 1 + cunt;
			} else {
				j = Math.abs(j);
				j -= 2;
				if (j < 0) {
					cc = 0;
				} else {
					cc = j + 1;
				}
			}

			count[i] = cc;

			int vc = i + 1;
			for (; vc < b.length; vc++)
				if (b[vc] == b[i]) {
					count[vc] = cc;
				} else
					break;

			i = vc - 1;
		}

		for (int p = 0; p < temp.length; p++) {
			System.out.print(count[Arrays.binarySearch(b, temp[p])] + " ");
		}
	}
}

class MyComparator implements Comparator<Integer> {

	@Override
	public int compare(Integer t1, Integer t2) {

		if (t1 <= t2)
			return -1;
		else
			return 1;
	}

}