全T怎么办

#include<iostream>
#include<algorithm>
using namespace std;
int n,m,q,a[1000005];
int f(int q) 
{
	int l=1,r=n;
	while (l<=r)
	{
		int mid=l+(r-l)/2;
		if (a[mid]>=q) r=mid;
		else l=mid+1;
	}
	if (a[l]==q) 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>>q;
		cout<<f(q)<<endl;
	}
	return 0;
}