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>).
a,k=map(int,input().split())
z=list(map(int,input().split()))
from collections import defaultdict
al=defaultdict(int)
count=0
i=0
while(count!=k and i<len(z)):
    if(al[z[i]]==0):
        count+=1
        al[z[i]]=1
    else:
        al[z[i]]+=1
    i+=1
if(count!=k):
    
    print(-1,-1)
    exit()
r=i-1
l=0
mini=i
sl=1
rl=r-l+1

while(r<len(z) and l<=r):
    
    if(al[z[l]]==1):
        al[z[l]]-=1
        count-=1
        l+=1
    else:
        al[z[l]]-=1
        l+=1
    
    while(count!=k and r<len(z)):
        r+=1
        if(r>=len(z)):
            break;
        if(al[z[r]]==0):
            al[z[r]]+=1
            count+=1
        else:
            al[z[r]]+=1
    
    if(count!=k):
        break;
    else:
        if(r-l+1<mini):
            sl=l
            rl=r
print(sl,rl)
        
   
        
        
        
    
    
