import copy

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

S = list(eval(input()))

count = 0

mae = [0]*K

ushiro = [0]*K

hi = 0

youso = 0

S_copy = copy.deepcopy(S)



while True:

    if S_copy[hi] == 'o':

        mae[youso] = hi+1

        youso += 1

        if youso == K:

            break

        for i in range(C):

            if hi+1+i <= N-1:

                S_copy[hi+1+i] = 'x'

    hi += 1



hi = 0

youso = 0

S_copy = copy.deepcopy(S)

S_copy.reverse()



while True:

    if S_copy[hi] == 'o':

        ushiro[youso] = hi-1

        youso += 1

        if youso == K:

            break

        for i in range(C):

            if hi+1+i <= N-1:

                S_copy[hi+1+i] = 'x'

    hi += 1



ushiro = list([N-x-1 for x in ushiro])

ushiro.reverse()



ans = []



for j in range(len(mae)):

    if mae[j] == ushiro[j]:

        ans.append(mae[j])



if ans:

    for j in range(len(ans)):

        print((ans[j]))

















import copy

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

S = list(eval(input()))

mae = [0]*K

ushiro = [0]*K

hi = 0

youso = 0



while True:

    if S[hi] == 'o':

        mae[youso] = hi+1

        youso += 1

        if youso == K:

            break

        hi += C

    hi += 1



hi = N-1

youso = 0



while True:

    if S[hi] == 'o':

        ushiro[youso] = hi+1

        youso += 1

        if youso == K:

            break

        hi -= C

    hi -= 1

ushiro.reverse()



for j in range(len(mae)):

    if mae[j] == ushiro[j]:

        print((mae[j]))



















import copy

N, K, C = list(map(int, input().split()))
S = list(eval(input()))
count = 0
mae = [0] * K
ushiro = [0] * K
hi = 0
youso = 0
S_copy = copy.deepcopy(S)
while True:
    if S_copy[hi] == "o":
        mae[youso] = hi + 1
        youso += 1
        if youso == K:
            break
        for i in range(C):
            if hi + 1 + i <= N - 1:
                S_copy[hi + 1 + i] = "x"
    hi += 1
hi = 0
youso = 0
S_copy = copy.deepcopy(S)
S_copy.reverse()
while True:
    if S_copy[hi] == "o":
        ushiro[youso] = hi - 1
        youso += 1
        if youso == K:
            break
        for i in range(C):
            if hi + 1 + i <= N - 1:
                S_copy[hi + 1 + i] = "x"
    hi += 1
ushiro = list([N - x - 1 for x in ushiro])
ushiro.reverse()
ans = []
for j in range(len(mae)):
    if mae[j] == ushiro[j]:
        ans.append(mae[j])
if ans:
    for j in range(len(ans)):
        print((ans[j]))

import copy

N, K, C = list(map(int, input().split()))
S = list(eval(input()))
mae = [0] * K
ushiro = [0] * K
hi = 0
youso = 0
while True:
    if S[hi] == "o":
        mae[youso] = hi + 1
        youso += 1
        if youso == K:
            break
        hi += C
    hi += 1
hi = N - 1
youso = 0
while True:
    if S[hi] == "o":
        ushiro[youso] = hi + 1
        youso += 1
        if youso == K:
            break
        hi -= C
    hi -= 1
ushiro.reverse()
for j in range(len(mae)):
    if mae[j] == ushiro[j]:
        print((mae[j]))

-count = 0 -S_copy = copy.deepcopy(S) -    if S_copy[hi] == "o": +    if S[hi] == "o": -        for i in range(C): -            if hi + 1 + i <= N - 1: -                S_copy[hi + 1 + i] = "x" +        hi += C -hi = 0 +hi = N - 1 -S_copy = copy.deepcopy(S) -S_copy.reverse() -    if S_copy[hi] == "o": -        ushiro[youso] = hi - 1 +    if S[hi] == "o": +        ushiro[youso] = hi + 1 -        for i in range(C): -            if hi + 1 + i <= N - 1: -                S_copy[hi + 1 + i] = "x" -    hi += 1 -ushiro = list([N - x - 1 for x in ushiro]) +        hi -= C +    hi -= 1 -ans = [] -        ans.append(mae[j]) -if ans: -    for j in range(len(ans)): -        print((ans[j])) +        print((mae[j]))