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.util.Arrays;
import java.util.Random;
import java.util.Scanner;
public class Main {

    public static void main(String[] args) {

        Scanner input = new Scanner(System.in);
        int n, q;
        Random rnd = new Random();
        n = input.nextInt();
        q = input.nextInt();
        int x;
        long[] arr1 = new long[n];
        for (int i = 0; i < n; i++) {
            arr1[i] = input.nextInt();
        }
        if (bubbleSort(arr1) >= 1) {
            for (int i = 0; i < n; i++) {
                int rndom = (int) ((Math.random()) * n);
                int rndom2 = (int) ((Math.random()) * n);
                long temp;
                temp = arr1[rndom];
                arr1[rndom] = arr1[rndom2];
                arr1[rndom2] = temp;
            }
            quickSort(arr1, 0, n - 1);
        }else{
            Arrays.sort(arr1);
        }
        for (int i = 0; i < q; i++) {
            x = input.nextInt();
            System.out.print(binarySearch(arr1, 0, n - 1, x) + " ");
        }
    }

    private static int binarySearch(long[] arr, int st, int end, long key) {
        int mid = (st + end) / 2;
        int ans = 0;
        while (st <= end) {
            if (arr[mid] < key) {
                st = mid + 1;
                ans = mid + 1;
            } else if (arr[mid] == key) {
                st = mid + 1;
                ans = mid + 1;
            } else {
                end = mid - 1;
            }
            mid = (st + end) / 2;
        }
        return ans;
    }

    public static void quickSort(long[] arr, int start, int end) {

        int partition = partition(arr, start, end);

        if (partition - 1 > start) {
            quickSort(arr, start, partition - 1);
        }
        if (partition + 1 < end) {
            quickSort(arr, partition + 1, end);
        }
    }

    public static int partition(long[] arr, int start, int end) {
        long pivot = arr[end];

        for (int i = start; i < end; i++) {
            if (arr[i] < pivot) {
                long temp = arr[start];
                arr[start] = arr[i];
                arr[i] = temp;
                start++;
            }
        }

        long temp = arr[start];
        arr[start] = pivot;
        arr[end] = temp;

        return start;
    }

    static int bubbleSort(long[] arr) {
        int n = arr.length;
        long temp = 0;
        int flag=0;
        for (int j = 1; j < (n - 1); j++) {
            if (arr[j - 1] > arr[j]) {
                //swap elements
                flag++;
                temp = arr[j - 1];
                arr[j - 1] = arr[j];
                arr[j] = temp;
            }

        }

        return flag;
    }
}
