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>).
# t = int(input())
t = 1
while t:
    # n = int(input())
    n,k = map(int,input().split())
    L = list(map(int,input().split()))
    # s = str(input())
    start= 0
    end= n-1
    cnt = {}
    i = 0
    distinct = 0
    while i < n:
        if L[i] in cnt:
            cnt[L[i]] += 1
        else:
            cnt[L[i]] = 1
            distinct += 1
        i += 1
    if distinct < k:
        print(-1,-1)
    else:
        while end >= 0:
            if distinct < k:
                break
            else:
                cnt[L[end]] -= 1
                if cnt[L[end]] == 0:
                    distinct -= 1
                end -= 1
        end += 1
        cnt[L[end]] += 1
        distinct += 1
        while start < n:
            if distinct < k:
                break
            else:
                cnt[L[start]] -= 1
                if cnt[L[start]] == 0:
                    distinct -= 1
                start += 1
        start -= 1
        cnt[L[start]] += 1
        distinct += 1
        print(start+1,end+1)
    t -= 1