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>).
from collections import OrderedDict

n, k  = map(int, input().split())
main = OrderedDict()
a = [int(i) for i in input().split()]
array = [float('inf')] * n
for i in range(n):
    ans = main.get(a[i], -1)
    if ans == -1:
        main[a[i]] = i+1
    else:
        main.pop(a[i])
        main[a[i]] = i+1
    if len(main) == k:
        first_elem = list(main.keys())[0]
        form = i - main.get(first_elem) + 2
        array[form] = f"{main.get(first_elem)} {i+1}"
        main.pop(first_elem)

f=1
for i in array:
    if i != float('inf'):
        print(i)
        f = 0
        break
if f:
    print('-1 -1')