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=list(map(int,input().split()))
a=list(map(int,input().split()))
d=dict()
for ll in a:
    if ll in d:
        d[ll]+=1
    else:
        d[ll]=1
if len(d)<k:
    print(-1,-1)
else:
    b=[]
    for key in d:
        b.append(key)
    sum=0
    ans=b[0]
    ans2=b[k-1]
    for j in range(k):
        sum+=d[b[j]]
    maxima=sum
    for g in range(k,len(b)):
        sum-=d[b[g-k]]
        sum+=d[b[g]]
        if sum>maxima:
            maxima=sum
            ans=b[g-k+1]
            ans2=b[g]
    strt = 0
    end=n-1
    a1=-1
    while strt <= end:
        mid = strt + (end - strt) // 2
        if a[mid]<ans:
            strt=mid+1
        elif a[mid]==ans:
            a1=mid+1
            end=mid-1
        else:
            end=mid-1
    s=0
    e=n-1
    a2=-1
    while s<=e:
        mid = s+(e-s)//2
        if a[mid] <ans2:
            s= mid + 1
        elif a[mid] ==ans2:
            a2= mid + 1
            s=mid+1
        else:
            e=mid- 1
    print(a1,a2)
