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>).
# بسم الله الرحمن الرحيم

m, k = list(map(int, input().split()))
seq  = list(map(int, input().split()))

# make array of frequencis
# seq  -> [4, 7, 7, 3]
# freq -> [1, 2, 2, 3]  
# 2 in position 3 means that, untill position 3 on seq array we met 2 distinct items, {4, 7}


s = set()
counter = 0
freq = seq[:]    # just a population with original, willbe all overwritten 
distincts = 0
for item in seq:
    if item not in s: 
        s.add(item)
        distincts += 1
    freq[counter] = distincts
    counter += 1

print(freq)

# to get the minimal inclusion, the criterion is:
# l is the first last position you meet 1
# r is the first position you meet k

try:
    r = freq.index(k)
except (ValueError):
    print(-1, -1)
    exit()

freq.reverse()
index = freq.index(1)
l = len(freq) - index - 1

print(l+1, r+1)    # +1 because output is not 0-based indecies


    
    
        
        
