include [HTML_REMOVED]
using namespace std;
const int N = 1e6 + 10;
int main(){
int n, q;
int a[N];
scanf("%d%d", &n, &q);
for(int i=0; i<n; i++) scanf("%d", &a[i]);
while(q--){
int x;
scanf("%d", &x);
int l=0, r=n-1;
# 找左边界l,性质:右侧点都>=x,即找右侧点
while(l<r){
mid=(l+r)>>1;
if(x<=a[mid]) r=mid;
else l=mid+1; # 因为找右侧点,mid此时在左,答案在[mid+1, r]
}
if(x!=a[l]) cout<<"-1 -1"<<endl; #若不存在则找不到x
else{
cout<<l<<" ";
int l=0, r=n-1;
# 找右边界l,性质:左侧点都<=x,即找左侧点
while(l<r){
mid=(l+r+1)>>1;
if(x>=a[mid]) l=mid;
else r=mid-1; # 因为找左侧点,mid此时在右,答案在[l, mid-1]
}
cout<<l<<endl;
}
}
return 0;
}