podstroka

n, k = map(int, input().split())
s = input()

memo = [0] * 26
flag = False
l = r = 0
best_l = best_r = 0

while r < n:
    order = ord(s[r]) - ord('a')
    memo[order] += 1
    r += 1
    if memo[order] > k:
        flag = True
    elif r - l > best_r - best_l:
        best_l = l
        best_r = r

    while flag:
        order = ord(s[l]) - ord('a')
        memo[order] -= 1
        if memo[order] == k:
            flag = False
        l += 1

print(best_r - best_l, best_l + 1)