#include<stdio.h>
 int findfirst(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-;
         }else if(arr[mid]>x){
             high=mid-1;
         }else{
             low=mid+1;
         }
     }
     return ans;
 }
 int findLast(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;
         }
     }
     return ans;
 }
 int main(){
     int n,x;
     scanf("%d",&n);
     if(n<0){
         printf("Invalid input");
         return 0;
     }
     scanf("%d",&x);
     int arr[n];
     for(int i=0;i<n;i++)
     scanf("%d",&arr[i]);
     int First=findFirst(arr,n,x);
     int last=findlast(arr,n,x);
     if(first==-1)
     printf("-1");
     else
     printf("%d %d",First,last);
     return 0;
 }
 }