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>).
stroka = input().split()
n = int(stroka[0])
k = int(stroka[1])
arr = [int(i) for i in input().split()]
if len(list(set(arr))) < k:
    print('-1 -1')
    exit()
if k > n:
    print('-1 -1')
elif k == 1:
    print('1 1')
else:
    tmp = [0] * 200000
    i = 1
    l = 0
    r = 0
    cnt = 0
    while r < n:
        if tmp[arr[r]] == 0:
            cnt += 1
        if cnt == k:
           break
        tmp[arr[r]] += 1
        r += 1
    while l < r and tmp[arr[l]] > 1:
        tmp[arr[l]] -= 1
        l += 1
    print(l + 1, r + 1)
