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>).
number_of_element, k_distinct_numbers_mt = "7 4".split(" ")
elements_of_the_array = "4 7 7 4 7 4 7".split(" ")

number_of_element = int(number_of_element)
k_distinct_numbers_mt = int(k_distinct_numbers_mt)

rs_set = set()

def program():
    result_value = []
    for x in elements_of_the_array:
        rs_set.add(int(x))
        len_of_set = len(rs_set)
        if (len_of_set == k_distinct_numbers_mt):
            result_value.append(list(rs_set)[0])
            result_value.append(list(rs_set)[-1])
            break
    return result_value

def find_pos(set):
    position_final = [0 , 0]

    for x in range(0, number_of_element):
        if(int(elements_of_the_array[x]) == list(set)[0]):
            position_final[0] = x + 1

    for x in range(0, number_of_element):
        if(int(elements_of_the_array[x]) == list(set)[1]):
            position_final[1] = x + 1
            break
    return position_final


if __name__ == '__main__':
    set = program()
    if(len(set) == 0):
        print("-1 - 1")
        exit(0)
    print(set)
    position = find_pos(set)
    print(position)