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>).
num,k = map(int,input().split())
listnum = list(map(int,input().split()))
count = 1
for i in range(1,num):
    linhcanh = 1
    for j in range(i):
        if listnum[i] == listnum[j]:
            linhcanh = 0
            break
    if linhcanh == 1:
        count += 1
    if count == k:
        right = i
        break
leftTrue = 0
if count != k:
    print("-1 -1")
else:
    for i in range(right +1):
        lc1 = 1
        for j in range(i + 1,right + 1):
            if listnum[leftTrue] == listnum[j]:
                lc1 = 0
                break
        if lc1 == 1:
            print(str(leftTrue + 1),str(right + 1))
            exit()
        else:
            leftTrue += 1


