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 = list(map(int, input().split()))
a = list(map(int, input().split()))
def find_solution():
    i = 0
    sub_a = []
    check_point = n[1]
    r = 0
    length = 0
    if (len(set(a)) < check_point):
        print(-1,-1)
    else:
        while i <= len(a):
            sub_a.append(a[i])
            # print('sub_a',sub_a)
            set_sub_a = set(sub_a)
            r = len(sub_a)
            length = len(set_sub_a)
            if(length == check_point):
                break
            i+=1

        # print(r)
        # print(length)

        l = 0
        list_min = []
        while l <= r and length == check_point:
            # print(a[l:r])
            # print('len of list:',len(a[l:r]))
            list_min.append(len(a[l:r]))
            l+=1
            length = len(set(a[l:r]))
            # print('new length',length)

        print(r-min(list_min)+1,r)

find_solution()