爆零

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1e6+10;
int n,x,m[maxn];

int f1(int k)
{
	int l = 1,r = n;
	while(l<=r)
	{
		int mid = l+r>>1;
		if(m[mid]>k) r = mid-1;
		else l = mid+1;
	}
	return l<=n?l:-1;
}

int f2(int k)
{
	int l = 1,r = n;
	while(l<=r)
	{
		int mid = l+r>>1;
		if(m[mid] <k) l = mid+1;
		else r = mid-1;
	}
	return r>=1?r:-1;
}

signed main()
{
	cin >> n >> x;
	for(int i =1;i<=n;i++) cin >> m[i];
	sort(m+1,m+n+1);
	while(x--)
	{
		int k;
		cin >> k;
		cout << f1(k) << " " << f2(k) << endl;
	}
	
	return 0;
}