You've got an array *a*, consisting of *n* integers: *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>. Your task is to find a minimal by inclusion segment [*l*, *r*] (1 ≤ *l* ≤ *r* ≤ *n*) such, that among numbers *a*<sub class="lower-index">*l*</sub>,  *a*<sub class="lower-index">*l* + 1</sub>,  ...,  *a*<sub class="lower-index">*r*</sub> there are exactly *k* distinct numbers.

Segment [*l*, *r*] (1 ≤ *l* ≤ *r* ≤ *n*; *l*, *r* are integers) of length *m* = *r* - *l* + 1, satisfying the given property, is called minimal by inclusion, if there is no segment [*x*, *y*] satisfying the property and less then *m* in length, such that 1 ≤ *l* ≤ *x* ≤ *y* ≤ *r* ≤ *n*. Note that the segment [*l*, *r*] doesn't have to be minimal in length among all segments, satisfying the given property.
The first line contains two space-separated integers: *n* and *k* (1 ≤ *n*, *k* ≤ 10<sup class="upper-index">5</sup>). The second line contains *n* space-separated integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> — elements of the array *a* (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">5</sup>).
import sys,os 
from collections import Counter 

n,k=[int(i) for i in input().split()]
l=[int(i) for i in input().split()]

right=n-1 

d=Counter(l)
z=len(set(l)) 
left=0 
if(z<k):
    print(-1,-1)
else:
    #print('z',z)
    while(right>=left):
        #print("dright",d[l[right])
        if(z>k):
            if(d[l[right]]==1):
                z-=1
                d[l[right]]-=1 
            else:
                #print('crap')
                d[l[right]]-=1 
            
            right-=1 
            #print('right',right)
        else:
            #print('here',right)
            while(d[l[right]]>1 and right>=left):
                
                d[l[right]]-=1
                right-=1 
            while(d[l[left]]>1 and left<=right):
                
                d[l[left]]-=1
                left+=1 
            break 
    print(left+1,right+1)
    