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>).
import sys
#sys.setrecursionlimit(10**7)
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
############ ---- Input Functions ---- ############

def Array():
    n,k = invr()
    sequence = inlt()

    element_first_index_dict = {}
    element_last_index_dict = {}

    for index,n in enumerate(sequence):
        if n in element_first_index_dict.keys():
            element_last_index_dict[n] = index 
        else:
            element_first_index_dict[n] = index 
            element_last_index_dict[n] = index 
    
    elements = [key for key,value in element_last_index_dict.items()]
    last_indexes = [value for key,value in element_last_index_dict.items()]

    sorted_data = sorted(zip(last_indexes,elements))
    last_indexes_sorted, elements_acc = zip(*sorted_data)

    #print(elements_acc)
    #print(last_indexes_sorted)
    starting_index = last_indexes_sorted[0]
    #print("startting index:", starting_index)
    ending_index = -1
    distinct_elements = 1

    for e in elements_acc[1:]:
        if element_first_index_dict[e] > starting_index:
            distinct_elements += 1 
            ending_index = element_first_index_dict[e]
        
        if distinct_elements == k:
            break 
    
    if distinct_elements == k:
        print(str(starting_index+1) + ' ' + str(ending_index+1))
    else:
        print(str(-1) + ' ' + str(-1))
    
    return

Array()