def f(l, a, d):
    if l == len(a):
        return len(a)
    while d[a[l]] > 1:
        d[a[l]] -= 1
        l += 1
        if l == len(a):
            return len(a)
    return l


n, k = tuple(map(int, (input().split())))
a = list(map(int, input().split()))
l = 0
d = {}
m = (0, 0, 0)
for i in range(n):
    if a[i] not in d:
        d[a[i]] = 1
    else:
        if a[l] == a[i]:
            l += 1
            l = f(l, a, d)
        else:
            d[a[i]] += 1
    if len(d) >= k:
        m = l, i, i - l
        break
print(m[0]+1, m[1]+1)