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>).
def distinct(counts):
    # returns how many non zero elements
    result = 0
    for i in counts:
        if i != 0 : result += 1
    return result

m, k = list(map(int, input().split()))
seq  = list(map(int, input().split()))

n = max(seq)
counts = [0]*(n+1)
for item in seq:
    counts[item] += 1
#print(counts)

l = 0
r = m-1

d = distinct(counts)
if d < k:
    print(-1, -1)
    exit()
#print("========================")
# cut from right
last = None
while d>=k:
    last = seq.pop(r); r-=1
    counts[last] -= 1
    d = distinct(counts)
seq.append(last); r+=1
counts[last] += 1
d = distinct(counts)
#print("========================")
#print("========================")
#print(seq)
#print(counts)
#print(l, r)
#print(d, k)
#print("========================")
#print("========================")
# cut from left
last2 = None
while d>=k:
    last2 = seq.pop(0); l+=1
    counts[last2] -= 1
    d = distinct(counts)
seq.insert(0, last2); l-=1
counts[last2] += 1
d = distinct(counts)

#print(seq)
#print("========================")
print(l+1, r+1)