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 find_segment(n, k, arr):
    seen = set()
    uniq = [x for x in arr if x not in seen and not seen.add(x)]
    if len(uniq) < k:
        return -1, -1

    replicated_elems = list(set([x for x in arr if arr.count(x) > 1]))
    uniq_replica = list(set(replicated_elems).intersection(uniq))
    segment_index = []
    count = 0
    for i in uniq:
        segment_index.append(arr.index(i)+1)
        count += 1
        if count == k:
            break
    segment = []
    for i in segment_index:
        segment.append(arr[i])
  #  if set(uniq).issubset(set(segment)):
    if segment_index[1] != (segment_index[0] + 1):
        segment_index[0] = segment_index[1] - 1
    return segment_index[0], segment_index[-1]

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

l, r = find_segment(n,k,arr)

print(l, r)





