结果

import java.util.Scanner;
public class Main{
	static int N = 1000010;
	static int n;
	static int m;
	static int[] a = new int[N];
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		m = sc.nextInt();
		for(int i = 0;i < n;i++) 
			a[i] = sc.nextInt();
		while(m-- > 0) {
			int k = sc.nextInt();
			int l = 0;
			int r = n-1;
			while(l < r) {
				int mid = (l + r) / 2;
				if(a[mid] >= k) r = mid;
				else l = mid + 1;
			}
			if(k == a[r]) System.out.print(r+1+" ");
			else System.out.print(-1+" ");
		}
			
	}
}