#include <iostream>
#include <vector>

using namespace std;


    vector<int> searchRange(vector<int>& nums, int target) {
        vector<int> ans(2, -1);
        int s = 0;
        int e = nums.size() - 1;
        bool found = false;

        
        while (s <= e) {
            int mid = s + (e - s) / 2;
            if (nums[mid] == target) {
                found = true;
                break;
            } else if (nums[mid] < target) {
                s = mid + 1;
            } else {
                e = mid - 1;
            }
        }

        if (!found) {
            return ans;
        }

        int low = 0;
        int high = nums.size() - 1;
        int start = -1;
        int end = -1;

        
        while (low <= high) {
            int mid = low + (high - low) / 2;
            if (nums[mid] == target) {
                end = mid;
                low = mid + 1;
            } else if (nums[mid] < target) {
                low = mid + 1;
            } else {
                high = mid - 1;
            }
        }

       
        low = 0;
        high = nums.size() - 1;
        while (low <= high) {
            int mid = low + (high - low) / 2;
            if (nums[mid] == target) {
                start = mid;
                high = mid - 1;
            } else if (nums[mid] > target) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }

        ans[0] = start;
        ans[1] = end;

        return ans;
    }


int main() {
    int n;
    cin>>n;
    
        int target;
    cin >> target;
    

    vector<int> nums(n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }



   
    vector<int> result = searchRange(nums, target);

    cout << result[0] << " " << result[1] << endl;

    return 0;
}