求助，样例过了但提交全WA还一个RE

#include<iostream>
using namespace std;
int n,m,a[100000001],b[100001];
int find(int x){
    int l,r,mid;
    l=1;
    r=x;
    while(l<=r){
        mid=(l+r)/2;
        if(a[mid]<x)r=mid-1;
        if(a[mid]>x)l=mid+1;
        if(a[mid]==x)return 1;
    }
    return 0;
}
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];
    for(int i=1;i<=m;i++){
        if(find(b[i])==1)
            cout<<i<<" ";
        else 
            cout<<"-1"<<" ";
    }
    return 0;
}