2点RE

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