#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn =1e5+10;
int a[maxn];
int main() {
int n,m,x;
cin>>n>>m;
for(int i=0;i<n;i++) cin>>a[i];
while(m--){
cin>>x;
int l=0,r=n-1;
while(l<r){
int mid=(l+r)>>1;
if(a[mid]>=x) r=mid;//偏左半边
else l=mid+1;
}
if(a[l]!=x) cout<<"-1 -1
";
else{
cout<< l <<" ";
int l=0,r=n-1;
while(l<r){
int mid=(l+r+1)>>1;
if(a[mid]<=x) l=mid;//偏右半边
else r=mid-1;
}
cout<< l <<"
";
}
}
return 0;
}