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>).
n, k = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
if k == 1:
    print("1 1")
else:
    unique = [a[0]]
    previous = a[0]
    l = 1
    r = 0
    count_dupli = 0
    count_number = 1
    for i in range(1,n):
        if a[i] == a[0]:
            l += 1
        else:
            break
    for i in range(l,n):
        if a[i] not in unique:
            unique.append(a[i])
            count_number = 1
        else:
            count_dupli += 1
        if count_number == k or (n - 1 - i + count_number < k):
            break
    r = count_dupli + (count_number-1) + l
    if count_number==k:
        print(f"{l} {r}")
    else:
        print("-1 -1")