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()))
l = 0
r = n-1

distinct_element = []
for i in range(0, max(a)+1):
    distinct_element.append(0)

cnt_distinct = 0

for i in range(0, n-1):
    check = False
    cnt_distinct = 0
    for j in range(0, max(a)+1):
        distinct_element[j] = 0

    distinct_element[a[i]] += 1
    cnt_distinct += 1
    for j in range(i+1, n):
        if (distinct_element[a[j]] == 0):
            cnt_distinct += 1
        distinct_element[a[j]] += 1
        if (cnt_distinct == k):
            check = True
            l = i
            r = j
            break
    if check == False and i == 0:
        print(-1, -1)
        exit()
    if check == True:
        break
res_r = r
res_l = l
# print(res_l,res_r)
# print(distinct_element)

for i in range(l, r+1):
    distinct_element[a[i]] -= 1
    if (distinct_element[a[i]] > 0):
        res_l += 1
    else:
        break

print(res_l+1, res_r+1)
