EEEE

n, k = map(int, input().split())
mas=list(map(int, input().split()))
j = k
mn=n+1
l,r=-1,-1
for i in range(n):
    while len(set(mas[i:j]))<k and j<n:
        j+=1
    g=len(set(mas[i:j]))
    if mn>j-i and g>=k:
        mn = j-i
        l, r = i, j
print(l+1, r)