#include <iostream>

using namespace std;

const int N = 100010;

int n, q;
int a[N];
int k;

int main() {
    cin >> n >> q;
    for (int i = 0; i < n; ++i) cin >> a[i];
    while (q--) {
        cin >> k;
        int left, right;
        int l = 0, r = n - 1;
        while (l < r) {
            int mid = (l + r) >> 1;
            if (a[mid] >= k) r = mid;
            else l = mid + 1;
        }
        if (a[l] != k) {
            cout << "-1 -1" << endl;
            continue;
        }
        left = l;
        l = 0, r = n - 1;
        while (l < r) {
            int mid = (l + r + 1) >> 1;
            if (a[mid] <= k) l = mid;
            else r = mid - 1;
        }
        right = l;
        cout << left << " " << right << endl;
    }

    return 0;
}