#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int a[N];
int main()
{
    int n,q;
    cin >> n >>q;
    for (int i = 0; i < n; i ++ ) cin >> a[i];
    while(q--){
        int x,l=0,r=n-1;
        cin >> x;
        while(l<r){
            int mid=l+r >>1;
            if(x<=a[mid]) r=mid;
            else l=mid+1;
        }
        if(a[l]!=x) cout << "-1 -1"<<endl;
        else{
            cout << l <<" ";
            l=0,r=n-1;
            while(l<r){
                int mid=l+r+1 >>1;
                if(x<a[mid]) r=mid-1;
                else l=mid;
            }
            cout << r <<endl;
        }
    }
    return 0;
}