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.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
//import java.util.Scanner;
import java.util.Set;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
	

	//static Scanner in = new Scanner(System.in);
	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	public static void main(String[] args) throws IOException {
		StringTokenizer s = new StringTokenizer(br.readLine());
		int n = Integer.parseInt(s.nextToken());
		int m = Integer.parseInt(s.nextToken());
		ArrayList <Integer> a = new ArrayList<Integer>();
		int b[] = new int [m];
		StringTokenizer s1 = new StringTokenizer(br.readLine());
		String s2 = br.readLine();
		for (int i=0; i<n; i++){
			a.add(Integer.parseInt(s1.nextToken()));
		}
		b = Arrays.stream(s2.split(" ")).mapToInt(Integer::parseInt).toArray();
		Collections.sort(a);
		for (int i=0;i<m;i++){
			int st = 0;
			int end = n-1;
			int mid = 0;
			int elem = b[i];
			mid = cntr(n,m,mid,st,end,elem,a);
			System.out.print(mid);
			if (i!=m-1){
				System.out.print(" ");
			}
		}
	}
	public static int cntr (int n,int m,int mid, int st,int end,int elem,ArrayList<Integer> a){
		
			while (true){
				mid = (st+end)/2;
				if (mid>0){
					if (elem<a.get(mid)&&elem>=a.get(mid-1)){
						
						break;
					}
					else if (elem<a.get(mid)){
						if (mid==1){
							mid = 0;
							break;
						}
						else
						end = mid-1;
					}
					else if (elem>=a.get(mid)){
						st = mid +1;
						if(mid==n-1){
							mid =n;
							break;
						}
					}
				}
				else{
					if (elem>=a.get(0))mid=1;
					else mid=0;
					break;
				}
				 
			}
			return mid;
		}
	
}
