def solve():
try:
   n = int(input().strip())
   if n < 0:
     print("Invalid input")
     return

   x=int(input().strip())
   arr=input().split()
 
if len(arr) !=n:
     print("Invalid input")
     return
 try:
     arr = list(map(int,arr))
     except:
         print("Invalid input")
         return
     if n == 0:
         print(-1)
         return
     
    def find_first():
        l,r = 0,n - 1
        ans = -1
        while l <= r
        mid = (l+r)//2
        if arr[mid] == x:
            ans = mid
            r = mid - 1
            elif arr[mid] < x:
                l = mid + 1
            else:
                r = mid-1
                return first
        def find_last():
            l,r = 0,n - 1
            last = -1
            while l <= r:
                mid = (l+r)//2
                if arr[mid] == x:
                    last = mid
                    l = mid + 1
                elif arr[mid]<x:
                    l = mid + 1
                else:
                    r = mid - 1
                    return last
                
                first = find_first()
                lasr = find_last()
                
                if first == -1:
                    print(-1)
                else:print(first,last)
        except:
            print("Invalid input")