#include<iostream>
using namespace std;
const int N=1e5+10;
int n,m,x;
int q[N];
int bsearch_1(int l,int r)
{
while(l<r)
{
int mid=l+r>>1;
if(q[mid]>=x) r=mid;
else l=mid+1;
}
return l;
}
int bsearch_2(int l,int r)
{
while(l<r)
{
int mid=l+r+1>>1;
if(q[mid]<=x) l=mid;
else r=mid-1;
}
return l;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++) scanf("%d",&q[i]);
while(m--)
{
scanf("%d",&x);
int l=0,r=n-1;
l=bsearch_1(l,r);
if(q[l]!=x) printf("-1 -1\n");
else
{
cout<<l<<" ";
int l=0,r=n-1;
l=bsearch_2(l,r);
printf("%d\n",l);
}
}
return 0;
}
bool check(int x) {
}
int bsearch_1(int l, int r)
{
while (l < r)
{
int mid = l + r >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
return l;
}
int bsearch_2(int l, int r)
{
while (l < r)
{
int mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
return l;
}