#include<iostream>
#include<math.h>

using namespace std;
typedef long long LL;
int const N=100010;
LL  a[N],n,m;
int ans;
int bf(int x)
{
	int l=0,r=n+1;
	while(l+1!=r)
	{	int mid=(l+r)/2;
		if(a[mid]<x)
		l=mid;
		else
		r=mid;
	}
	if(a[r]==x) return r;
	else return -1;
}
int main()
{	cin>>n>>m;
	for(int i=1;i<=n;i++)
	cin>>a[i];
	while(m--)
	{
		long long q;
		cin>>q;
		cout<<bf(q)<<" ";
	}
	return 0;
}
```cpp