#include<stdio.h>
int firstOccurrence(int arr[],int n,int x) {
    int low = 0, high = n -1, ans = -1;
    while (low <= high) {
        int mid = (low + high) / 2;
        if (arr[mid] == x) {
            ans = mid;
            high = mid - 1;
        }else if (arr[mid] < x) {
            low = mid + 1;
        }else {
            high = mid - 1;
        }
    }
    return ans;
}

int lastOccurrence(int arr[], int n, int x) {
    int low = 0, high = n - 1, ans =-1;
    while (low <= high) {
        int mid = (low + high) / 2;
        if (arr[mid] == x) {
            ans = mid;
            low = mid + 1;
        } else if (arr[mid] < x) {
            low = mid + 1;
        } else {
            high = mid - 1;
        }
    }
    return ans;
}

int main () {
    int n, x, arr[100];
    
    scanf("%d", &n);
    scanf("%d", &x);
    
    if (x < 0) {
        printf("Invalid input");
        return 0;
    }
    
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }
    
    int first = firstOccurrence(arr, n, x)
    int last = lastOccurrence(arr, n, x);
    
    if (first == -1) {
        printf("-1");
    }else {
        printf("%d %d", first, last);
    }
    
    return 0;
}