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.Scanner;


public class prob {
	static int c[];
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String temp[]=br.readLine().split(" ");
		int n=Integer.parseInt(temp[0]);
		int m=Integer.parseInt(temp[1]);
        Integer a[]=new Integer[n];
        int b[]=new int[m];
        c=new int[m];
        String t[]=br.readLine().split(" ");
        for(int i=0;i<n;i++)
        	a[i]=Integer.parseInt(t[i]);
        String tt[]=br.readLine().split(" ");
        for(int i=0;i<m;i++)
        {	b[i]=Integer.parseInt(tt[i]);
        	c[i]=i;
        }
        Arrays.sort(a);
       /* Arrays.sort(a);
        sort(b);
        int i=0,j=0,count=0;
        int ans[]=new int[m];
        while(j<b.length)
        {
        	while(i<a.length&&b[j]>=a[i])
        	{
        		count++;
        		i++;
        	}
        	ans[c[j]]=count;
        	j++;
        	
        }
        for(int k=0;k<ans.length;k++)
        	System.out.print(ans[k]+" ");*/
        int count=0;
        
        for(int i=0;i<b.length;i++)
        {
        	int item=b[i];
        	int right=a.length,left=0,mid;
        	count=0;
        		if(b[i]>=a[0])
        		{
        	     while (right - left > 1) {
        	        mid = left + (right - left) / 2;
        	        if (a[mid] <= item)
        	            left = mid;
        	        else
        	            right = mid;
        	    }
        	    count+=(left+1);
        	System.out.print(count+" ");}
        		else
        		{
        			System.out.println("0 ");
        		}
        }
     }
	public static void sort(int  []a)
	{
		sort(a,0,a.length-1);
	}
	public static int partition(int []a,int low,int high)
	{
		int i=low;
		int j=high+1;
		while(true)
		{
			while((a[++i]<a[low]))
				if(i==high)
					break;
			while((a[--j]>a[low]))
				if(j==low)
					break;
			if(i>=j)
				break;
			exh(a,i,j);
		}
		exh(a,low,j);
		return  j;
		
	}
	public static void exh(int[] a,int i,int j)
	{
		int temp=a[i];
		a[i]=a[j];
		a[j]=temp;
		temp=c[i];
		c[i]=c[j];
		c[j]=temp;
	}
	public static void sort(int []a,int low,int high)
	{
		if(high<=low)
			return;
		int p=partition(a,low,high);
		sort(a,low,p-1);
		sort(a,p+1,high);
	}
}
