0分求调J

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<climits>
#include<iomanip>
#include<vector>
#include<queue>
#include<map>
#include<cctype>
#include<set>
using namespace std;
long long n, m, a[1000005];
int main(){
	scanf("%lld%lld", &n, &m);
	for(int i = 1; i <= n; i ++) {
		scanf("%lld", &a[i]);
	}
	while(m --){
		long long x, y;
		scanf("%lld", &x);
		y = lower_bound(a + 1, a + n + 1, x) - a;
		if(a[y] != x) {
			printf("-1\n");
		}else{
			printf("%lld\n", y);
		}
	}
	return 0;
}