#include<iostream>
using namespace std;
const int N = 1e5 + 10;
int q[N];
int n,m;
int main() {
cin >> n>>m;
int i;
for (i = 0; i < n; i++)
cin >> q[i];
while (m--) {
int x,l=0,r=n-1;
cin >> x;
while (l < r) {//找到第一个不小于x的数
int mid = l + r >> 1;
if (q[mid] < x)l = mid + 1;
else r = mid;
}
if (q[l] != x) {
cout << "-1 -1" << endl;
continue;
}
cout << l;
l = 0, r = n-1;
while (l < r) {//找到最后一个不大于x的数
int mid = l + r+1 >> 1;
if (q[mid] > x)r = mid - 1;
else l = mid;
}
if (q[l] == x)cout << " " << l << endl;
}
return 0;
}