from collections import deque

N, K, C = list(map(int, input().split()))

S = eval(input())



fastest = deque([])

latest = deque([])





date = 1



for work_days in range(K):

    while S[date - 1] == 'x':

        date += 1

    fastest.append(date)

    date += C + 1



date = 1



for work_days in range(K):

    while S[- date] == 'x':

        date += 1

    latest.append(N - (date - 1))

    date += C + 1



fastest = list(fastest)

latest = list(latest)



for i in range(K):

    if fastest[i] == latest[- (i + 1)]:

        print((fastest[i]))
from collections import deque

N, K, C = list(map(int, input().split()))

S = eval(input())



fastest = deque([])

latest = deque([])





date = 1



for work_days in range(K):

    while S[date - 1] == 'x':

        date += 1

    fastest.append(date)

    date += C + 1



date = 1



for work_days in range(K):

    while S[- date] == 'x':

        date += 1

    latest.append(N - (date - 1))

    date += C + 1



for i in range(K):

    f = fastest.popleft()

    l = latest.pop()

    if f == l:

        print(f)
from collections import deque

N, K, C = list(map(int, input().split()))
S = eval(input())
fastest = deque([])
latest = deque([])
date = 1
for work_days in range(K):
    while S[date - 1] == "x":
        date += 1
    fastest.append(date)
    date += C + 1
date = 1
for work_days in range(K):
    while S[-date] == "x":
        date += 1
    latest.append(N - (date - 1))
    date += C + 1
fastest = list(fastest)
latest = list(latest)
for i in range(K):
    if fastest[i] == latest[-(i + 1)]:
        print((fastest[i]))

from collections import deque

N, K, C = list(map(int, input().split()))
S = eval(input())
fastest = deque([])
latest = deque([])
date = 1
for work_days in range(K):
    while S[date - 1] == "x":
        date += 1
    fastest.append(date)
    date += C + 1
date = 1
for work_days in range(K):
    while S[-date] == "x":
        date += 1
    latest.append(N - (date - 1))
    date += C + 1
for i in range(K):
    f = fastest.popleft()
    l = latest.pop()
    if f == l:
        print(f)

-fastest = list(fastest) -latest = list(latest) -    if fastest[i] == latest[-(i + 1)]: -        print((fastest[i])) +    f = fastest.popleft() +    l = latest.pop() +    if f == l: +        print(f)