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>).
from collections import Counter
n,k = map(int, input().split())
arr = list(map(int, input().split()))
c = Counter(arr)
if len(c) < k:
    print(-1, -1)
    exit()
l,r = 0,n-1
ans = n
distinct = len(c)
while(ans > k):
    if c[arr[l]] >=  c[arr[r]] >= 1:
        c[arr[l]] -= 1
        l += 1
    elif c[arr[r]] >=  c[arr[l]] >= 1:
        c[arr[r]] -= 1
        r -= 1 
    if c[arr[l]] == 0 or c[arr[r]] == 0:
        distinct -= 1
    ans = min(ans, r-l+1)
print(l,r)    
left, right = arr[l] , arr[r]    
while(c[arr[l]] == left) :
    l+=1
while(c[arr[r]] == right) :
    r -=1
print(l+1, r+1)       
            



















# lis = [0]
# dict = {
#     arr[0] : 1
# }
# j = 1
# ans = 10**5+2
# for i in range(1,n):
#     if arr[i] in dict:
#         continue
#     dict[arr[i]] = 1
#     lis.append(i-1)
#     lis.append(i)
#     j += 1
#     ans = min(ans)
# print(*lis)    
