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>).
def find_segment(num_items, K_num, array):
    l_post = -1
    r_post = -1
    if K_num == 1:
        return 1, 1
    if len(list(set(array))) < K_num:
        return -1, -1
    temp = set([])
    for index in range(num_items):
        #find the `start` position first
        if l_post == -1 and array[index] != array[0]:

            l_post = index
            print(l_post)
            temp.add(array[0])
            temp.add(array[index])
        elif l_post != -1:
            temp.add(array[index])
        if len(temp) == K_num:
            # print(temp)
            r_post = index + 1
            print(l_post, r_post)
            break
    temp = set([])
    print(array[l_post : r_post + 1])
    if l_post != -1 and r_post != -1:
        for index in range(r_post - 1, l_post - 2, -1):
            temp.add(array[index])
            # print(index)
            if len(temp) == K_num:
                # print(temp)
                # print(index)
                l_post = index + 1
                return l_post, r_post
    return -1, -1

if __name__ == '__main__':
    num_items, K_num = list(map(int, input().split()))
    array = list(map(int, input().split()))
    result = find_segment(num_items, K_num, array)
    print(result[0], result[1])