#include <iostream>
#include <algorithm>
using namespace std;
const int N = 100010;
int n, m, a[N], t;
int main(){
cin >> n >> m;
for (int i = 0 ; i < n ; i ++ ) cin >> a[i];
while(m --){
cin >> t;
//找左边界
int l = 0, r = n - 1;
while(l < r){
int mid = l + r >> 1;
if (a[mid] >= t) r = mid;
else l = mid + 1;
}
if (a[l] != t) cout << "-1 -1" << endl;//检验找没找到
else{//找得到得情况,找右边界
cout << l << ' ';
l = 0, r = n - 1;
while(l < r){
int mid = l + r + 1 >> 1;
if (a[mid] <= t) l = mid;
else r = mid - 1;
}
cout << l << endl;
}
}
return 0;
}