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.*;
import java.lang.*;
import java.io.*;

	public class FastIO {
			
		BufferedReader br;
		StringTokenizer st;
		
		public FastIO(){ // constructor
			
			br = new BufferedReader(new InputStreamReader(System.in));
		}
		
		String next(){
			
			while (st == null || !st.hasMoreElements()){
				try{
					st = new StringTokenizer(br.readLine());
				}
				
				catch (IOException e){
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
		
		int nextInt(){
			
			return Integer.parseInt(next());
		}
		
		long nextLong(){
			
			return Long.parseLong(next());
		}
		
		double nextDouble(){
			return Double.parseDouble(next());
		}

		String nextLine(){
			
			String str = "";
			try{
				
				str = br.readLine();
			}
			catch (IOException e){
				
				e.printStackTrace();
			}
			return str;
		}
		
		static void sort(int[] arr){
			
	        int n = arr.length;
	        
	        Random rnd = new Random();
	        
	        for(int i = 0; i < n; ++i){
	        	
	            int tmp = arr[i];
	            int randomPos = i + rnd.nextInt(n - i);
	            arr[i] = arr[randomPos];
	            arr[randomPos] = tmp;
	        }
	        
	        Arrays.sort(arr);
	   }
		
		// int dir[][] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
		
		// T.C. -> O(log N)
		static int sumOfDigits(int n) {
			int sum = 0;
			while(n > 0) {
				sum += n % 10;
				n = n / 10;
			}
			return sum;
		}
		
		static int gcd(int a, int b) {
			if(b == 0) {
				return a;
			}
			return gcd(b, a % b);
		}
		
		static class Points{
			int x,y;
			Points(int x, int y){
				this.x = x;
				this.y = y;
			}
		}
		
		static boolean isPrime(int n) {
			for(int i = 2; i * i <= n; i++) {
				if(n % i == 0) {
					return false;
				}
			}
			return true;
		}
		
	public static void main(String[] args) throws Exception{
		
		FastIO in = new FastIO();
		PrintWriter out = new PrintWriter(System.out);
		
//		int test = in.nextInt();
//		
//		while(test-- > 0) {
			
			int n = in.nextInt();
			int m = in.nextInt();
			
			int a[] = new int[n];
			int b[] = new int[m];
			
			for(int i = 0; i < n; i++) {
				a[i] = in.nextInt();
			}
			
			sort(a);
			
			StringBuilder sb = new StringBuilder();
			
			for(int i = 0; i < m; i++) {
				b[i] = in.nextInt();
				int ans = bs(a, b[i]);
				sb.append(ans + " ");
			}
			
			out.println(sb.toString());
		//}
		
		out.flush();
		out.close();
	}
	static int bs(int arr[], int num) {
		
		int lo = 0, hi = arr.length - 1, mid = 0;
		boolean isPresent = false;
		
		while(lo <= hi) {
			mid = (lo + hi) / 2;
			
			if(arr[mid] == num) {
				isPresent = true;
			}
			
			if(arr[mid] <= num) {
				lo = mid + 1;
			}
			
			else {
				hi = mid - 1;
			}
		}
		
		return lo;
	}
}