1
#include <bits/stdc++.h>
2
using namespace std;
3

4
const int N = 100010;
5

6
int n, q;
7
int a[N];
8
int x;
9

10
bool check_left(int mid) {
11
    return a[mid] >= x;
12
}
13

14
bool check_right(int mid) {
15
    return a[mid] <= x;
16
}
17

18
int bsearch_left(int l, int r) {
19
    while (l < r) {
20
        int mid = (l + r) >> 1;
21
        if (check_left(mid)) r = mid;
22
        else l = mid + 1;
23
    }
24
    return l;
25
}
26

27
int bsearch_right(int l, int r) {
28
    while (l < r) {
29
        int mid = (l + r + 1) >> 1;
30
        if (check_right(mid)) l = mid;
31
        else r = mid - 1;
32
    }
33
    return l;
34
}
35

36
int main() {
37
    cin >> n >> q;
38
    for (int i = 0; i < n; i++) cin >> a[i];
39

40
    while (q--) {
41
        cin >> x;
42

43
        int l = bsearch_left(0, n - 1);
44
        if (a[l] != x) {
45
            cout << "-1 -1" << endl;
46
        } else {
47
            int r = bsearch_right(0, n - 1);
48
            cout << l << " " << r << endl;
49
        }
50
    }
51

52
    return 0;
53
}