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 sys
import collections

n, k = map(int, input().split())
A = list(map(int, input().split()))

if len(set(A)) < k:
    print(-1, -1)
    sys.exit(0)
    
counter = collections.Counter()
front, back = 0, 0
best = (0, len(A)-1)
while front < len(A):
    counter[A[front]] += 1
    if len(counter) >= k:
        while True:
            if len(counter) == k and counter[A[back]] == 1:
                break
            else:
                if counter[A[back]] == 1:
                    del counter[A[back]]
                else:
                    counter[A[back]] -= 1
                back += 1
        if front - back < best[1] - best[0]:
            best = (back, front)
    front += 1
print(best[0]+1, best[1]+1)