#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int q[N];

int main(void)
{
    int n,k;
    scanf("%d%d",&n,&k);
    for (int i = 0;i < n;++i)
        scanf("%d",&q[i]);
    while (k--)
    {
        int x, l = 0,r = n - 1;
        scanf("%d",&x);
        while (l < r)
        {
            int m = l + (r - l) / 2;
            if (q[m] >= x)  r = m;
            else    l = m + 1;
        }
        if (q[l] != x)
        {
            printf("-1 -1\n");
            continue;
        }
        printf("%d ",l);
        l = 0,r = n - 1;
        while (l < r)
        {
            int m = l + (r - l + 1) / 2;
            if (q[m] <= x)  l = m;
            else    r = m - 1;
        }
        printf("%d\n",l);
    }
    return 0;
}