include[HTML_REMOVED]
using namespace std;
const int N=1e5+10;
typedef long long LL;
int q,n,a[N],mid;
int left(int a[],int l,int r,int num)
{
if(a[0]==num)return 0;
if(l>=r)return 0;
while(l[HTML_REMOVED]>1;
if(num>a[mid])l=mid+1;
if(num<=a[mid])r=mid;
}
if(l>=r)
{
if(a[l]!=num)return -1;
else return l;
}
}
int right(int a[],int l,int r,int num)
{
if(a[n-1]==num)return n-1;
if(l>=r)return 0;
while(l[HTML_REMOVED]>1;
if(num>=a[mid])l=mid;
if(num[HTML_REMOVED]=r)
{
if(a[r]!=num)return -1;
else return r;
}
}
int main()
{
cin>>n>>q;
for(int i=0;i[HTML_REMOVED]>a[i];
while(q–)
{
int num;
cin>>num;
cout<<left(a,0,n-1,num)<<” “<<right(a,0,n-1,num)<<endl;
}
return 0;
}