#include<iostream>
#include<algorithm>

using namespace std;

const int N=1e5+10;
int a[N];

int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i];
    sort(a,a+n);



    while(m--)
    {
        int x;
        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) puts("-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<<r<<endl;
        }

    }
    return 0;
}