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>).
n,k=map(int,input().split())
a=list(map(int,input().split()))

per=list(set(a))
if len(per)< k:
    print(-1,-1)

else:
    q=[[a[0],1,-1]]
    p=a[0]
    i=1

    while True:
        if i<n-k:
            for t in range(len(q)):
                if a[i]!=p and q[t][2]!=k:
                    q[t][1]+=1
                    if q[t][1]==k:
                        q[t][2]=a[i]
            if a[i]!=p:
                q.append([a[i],1,-1])
            p=a[i]
                
        elif i<n:
            for t in range(len(q)):
                if a[i]!=p and q[t][2]!=k:
                    q[t][1]+=1
                    if q[t][1]==k:
                        q[t][2]=a[i]
            p=a[i]
        else:
            break
        i+=1
        
    l=0
    r=0
    m=11111111111111111111
    for t in range(len(q)):
        m1=q[t][2]-q[t][0]+1
        if q[t][1]==k and q[t][2]!=-1 and m>m1:
            l=q[t][0]
            r=q[t][2]
            m=m1
    print(l,r)

# Sat Dec 21 2019 15:29:18 GMT+0300 (MSK)
