# https://atcoder.jp/contests/abc161/tasks/abc161_e

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

S = eval(input())



i = 0

left = []

while i < N and len(left) < K:

    if S[i] == 'o':

        left.append(i)

        i += (C + 1)

        continue

    i += 1



i = N - 1

right = []

while i >= 0 and len(right) < K:

    if S[i] == 'o':

        right.append(i)

        i -= (C + 1)

        continue

    i -= 1



n = len(left)

for i in range(n):

    if left[i] == right[n - i - 1]:

        print((left[i] + 1))

# https://atcoder.jp/contests/abc161/tasks/abc161_e



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

S = eval(input())



left = []

i = 0

while K > len(left):

    while True:

        if S[i] == 'o':

            left.append(i)

            i += C + 1

            break

        i += 1



right = []

i = N - 1

while K > len(right):

    while True:

        if S[i] == 'o':

            right.append(i)

            i -= (C + 1)

            break

        i -= 1



right.reverse()



ans = 0

for i in range(K):

    if left[i] == right[i]:

        print((left[i] + 1))

# https://atcoder.jp/contests/abc161/tasks/abc161_e
N, K, C = list(map(int, input().split()))
S = eval(input())
i = 0
left = []
while i < N and len(left) < K:
    if S[i] == "o":
        left.append(i)
        i += C + 1
        continue
    i += 1
i = N - 1
right = []
while i >= 0 and len(right) < K:
    if S[i] == "o":
        right.append(i)
        i -= C + 1
        continue
    i -= 1
n = len(left)
for i in range(n):
    if left[i] == right[n - i - 1]:
        print((left[i] + 1))

# https://atcoder.jp/contests/abc161/tasks/abc161_e
N, K, C = list(map(int, input().split()))
S = eval(input())
left = []
i = 0
while K > len(left):
    while True:
        if S[i] == "o":
            left.append(i)
            i += C + 1
            break
        i += 1
right = []
i = N - 1
while K > len(right):
    while True:
        if S[i] == "o":
            right.append(i)
            i -= C + 1
            break
        i -= 1
right.reverse()
ans = 0
for i in range(K):
    if left[i] == right[i]:
        print((left[i] + 1))

+left = [] -left = [] -while i < N and len(left) < K: -    if S[i] == "o": -        left.append(i) -        i += C + 1 -        continue -    i += 1 +while K > len(left): +    while True: +        if S[i] == "o": +            left.append(i) +            i += C + 1 +            break +        i += 1 +right = [] -right = [] -while i >= 0 and len(right) < K: -    if S[i] == "o": -        right.append(i) -        i -= C + 1 -        continue -    i -= 1 -n = len(left) -for i in range(n): -    if left[i] == right[n - i - 1]: +while K > len(right): +    while True: +        if S[i] == "o": +            right.append(i) +            i -= C + 1 +            break +        i -= 1 +right.reverse() +ans = 0 +for i in range(K): +    if left[i] == right[i]: