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 = input().split(" ")
elements_of_the_array = input().split(" ")

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



final_pos = [-1, -1]

def get_r_index():
    rs_set = set()
    for i in range(0, number_of_element):
        rs_set.add(int(elements_of_the_array[i]))
        if(len(rs_set) == k_distinct_numbers_mt):
            return i+1
        elif((i == number_of_element - 1) and (len(rs_set) < k_distinct_numbers_mt)):
            print("{} {}".format(final_pos[0], final_pos[1]))
            exit(0)

def get_l_index(r_index):
    rs_set = set()
    for i in range(r_index, -1, -1):
        rs_set.add(int(elements_of_the_array[i]))
        if(len(rs_set) == k_distinct_numbers_mt):
            return i+1


if __name__ == '__main__':
    r_index = get_r_index()
    l_index = get_l_index(r_index)
    print("{} {}".format(l_index, r_index))


    # print("INDEX {} | SET {}".format(index, set))
