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 numpy as np
R = lambda:map(int, input().split())
n,k = R()
a = [*R()]
l,r=0,n-1
cnt = np.zeros((max(a)+1,), dtype=np.int)
for i in range(n):
    cnt[a[i]]+=1
k_distinct = sum(cnt>0)   
if k_distinct < k:
    print("-1 -1")
else:
    while k_distinct>=k:
        cnt[a[r]]-=1
        if(cnt[a[r]]==0):
            k_distinct-=1
        r-=1
    r+=1
    k_distinct+=1
    while k_distinct==k:
        cnt[a[l]]-=1
        if(cnt[a[l]]==0):
            k_distinct-=1
        l+=1
    l-=1
    print("%d %d" % (l+1, r+1)) 