4个WA,1个RE，样例能过

#include<bits/stdc++.h>
using namespace std;
int n,m,a[10000],b[100000],c;
int find(int x)
{
	int l=1,r=n;
	while (l<r)
	{
		int mid=l+(r-l)/2;
		if (a[mid]>=x) r=mid;
		else l=mid+1;
	}
	
	if (a[l]==x) return l;
	else return -1; 
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=m;i++){
		cin>>b[i];
		c=find(b[i]);
		cout<<c<<" ";
	}
	return 0;
}