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

S = eval(input())

p = -C-1

L = []

R = []

for i in range(N):

  if i>p+C and S[i]=='o':

    L.append(i)

    p = i

p = N+C

for i in range(N-1,-1,-1):

  if p>C+i and S[i]=='o':

    R.append(i)

    p = i

R = R[::-1]

if len(L)>K or len(R)>K:

  exit()

ans = []

for a,b in zip(L,R):

  if a==b:

    ans.append(str(a+1))

print(('\n'.join(ans)))
N,K,C = list(map(int, input().split()))

S = eval(input())

dp0 = [0]*K

dp1 = [0]*K

step = C

cnt = 0

for i in range(N):

  if step>=C and S[i]=='o':

    dp0[cnt] = i

    cnt += 1

    if cnt==K:

      break

    step = 0

  else:

    step += 1

step = C

cnt = K-1

for i in range(N-1,-1,-1):

  if step>=C and S[i]=='o':

    dp1[cnt] = i

    cnt -= 1

    if cnt==-1:

      break

    step = 0

  else:

    step += 1

ans = 0

for i,(a,b) in enumerate(zip(dp0,dp1)):

  if a==b:

    print((a+1))
N, K, C = list(map(int, input().split()))
S = eval(input())
p = -C - 1
L = []
R = []
for i in range(N):
    if i > p + C and S[i] == "o":
        L.append(i)
        p = i
p = N + C
for i in range(N - 1, -1, -1):
    if p > C + i and S[i] == "o":
        R.append(i)
        p = i
R = R[::-1]
if len(L) > K or len(R) > K:
    exit()
ans = []
for a, b in zip(L, R):
    if a == b:
        ans.append(str(a + 1))
print(("\n".join(ans)))

N, K, C = list(map(int, input().split()))
S = eval(input())
dp0 = [0] * K
dp1 = [0] * K
step = C
cnt = 0
for i in range(N):
    if step >= C and S[i] == "o":
        dp0[cnt] = i
        cnt += 1
        if cnt == K:
            break
        step = 0
    else:
        step += 1
step = C
cnt = K - 1
for i in range(N - 1, -1, -1):
    if step >= C and S[i] == "o":
        dp1[cnt] = i
        cnt -= 1
        if cnt == -1:
            break
        step = 0
    else:
        step += 1
ans = 0
for i, (a, b) in enumerate(zip(dp0, dp1)):
    if a == b:
        print((a + 1))

-p = -C - 1 -L = [] -R = [] +dp0 = [0] * K +dp1 = [0] * K +step = C +cnt = 0 -    if i > p + C and S[i] == "o": -        L.append(i) -        p = i -p = N + C +    if step >= C and S[i] == "o": +        dp0[cnt] = i +        cnt += 1 +        if cnt == K: +            break +        step = 0 +    else: +        step += 1 +step = C +cnt = K - 1 -    if p > C + i and S[i] == "o": -        R.append(i) -        p = i -R = R[::-1] -if len(L) > K or len(R) > K: -    exit() -ans = [] -for a, b in zip(L, R): +    if step >= C and S[i] == "o": +        dp1[cnt] = i +        cnt -= 1 +        if cnt == -1: +            break +        step = 0 +    else: +        step += 1 +ans = 0 +for i, (a, b) in enumerate(zip(dp0, dp1)): -        ans.append(str(a + 1)) -print(("\n".join(ans))) +        print((a + 1))