from collections import deque
n, k = map(int, input().split())
n -= 1
s = input()
cnt = 0
q = deque()
ans = []
for i in range(n - 1, -1, -1):
    if s[i] == 'x':
        continue
    while q and q[0][0] > i + k:
        if not q[0][1]:
            cnt -= 1
        q.popleft()
    if cnt:
        q.append((i, True))
    else:
        cnt += 1
        q.append((i, False))
        if i < k:
            ans.append(i + 1)
if not ans:
    print(0)
else:
    print(*reversed(ans))