n, k, c = list(map(int, input().split()))

s = eval(input())

l = [-1] * k

r = [-1] * k

nowl = 0

indl = 0

while nowl < n and indl < k:

    for i in range(nowl, n):

        if s[i] == "o":

            l[indl] = i

            nowl = i + c + 1

            indl += 1

            break

nowr = n - 1

indr = k - 1

while nowr >= 0 and indr >= 0:

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

        if s[i] == "o":

            r[indr] = i

            nowr = i - c - 1

            indr -= 1

            break

for i in range(k):

    if l[i] == r[i]:

        print((l[i] + 1))

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

S = eval(input())

L = [-1] * K

R = [-1] * K

L_index = 0

L_count = 0

R_index = N - 1

R_count = K - 1



while L_index < N and L_count < K:

    if S[L_index] == "o":

        L[L_count] = L_index

        L_index += (C + 1)

        L_count += 1

    else:

        L_index += 1

while R_index >= 0 and R_count >= 0:

    if S[R_index] == "o":

        R[R_count] = R_index

        R_index -= (C + 1)

        R_count -= 1

    else:

        R_index -= 1



for i in range(K):

    if L[i] == R[i]:

        print((L[i] + 1))
n, k, c = list(map(int, input().split()))
s = eval(input())
l = [-1] * k
r = [-1] * k
nowl = 0
indl = 0
while nowl < n and indl < k:
    for i in range(nowl, n):
        if s[i] == "o":
            l[indl] = i
            nowl = i + c + 1
            indl += 1
            break
nowr = n - 1
indr = k - 1
while nowr >= 0 and indr >= 0:
    for i in range(nowr, -1, -1):
        if s[i] == "o":
            r[indr] = i
            nowr = i - c - 1
            indr -= 1
            break
for i in range(k):
    if l[i] == r[i]:
        print((l[i] + 1))

N, K, C = list(map(int, input().split()))
S = eval(input())
L = [-1] * K
R = [-1] * K
L_index = 0
L_count = 0
R_index = N - 1
R_count = K - 1
while L_index < N and L_count < K:
    if S[L_index] == "o":
        L[L_count] = L_index
        L_index += C + 1
        L_count += 1
    else:
        L_index += 1
while R_index >= 0 and R_count >= 0:
    if S[R_index] == "o":
        R[R_count] = R_index
        R_index -= C + 1
        R_count -= 1
    else:
        R_index -= 1
for i in range(K):
    if L[i] == R[i]:
        print((L[i] + 1))

-n, k, c = list(map(int, input().split())) -s = eval(input()) -l = [-1] * k -r = [-1] * k -nowl = 0 -indl = 0 -while nowl < n and indl < k: -    for i in range(nowl, n): -        if s[i] == "o": -            l[indl] = i -            nowl = i + c + 1 -            indl += 1 -            break -nowr = n - 1 -indr = k - 1 -while nowr >= 0 and indr >= 0: -    for i in range(nowr, -1, -1): -        if s[i] == "o": -            r[indr] = i -            nowr = i - c - 1 -            indr -= 1 -            break -for i in range(k): -    if l[i] == r[i]: -        print((l[i] + 1)) +N, K, C = list(map(int, input().split())) +S = eval(input()) +L = [-1] * K +R = [-1] * K +L_index = 0 +L_count = 0 +R_index = N - 1 +R_count = K - 1 +while L_index < N and L_count < K: +    if S[L_index] == "o": +        L[L_count] = L_index +        L_index += C + 1 +        L_count += 1 +    else: +        L_index += 1 +while R_index >= 0 and R_count >= 0: +    if S[R_index] == "o": +        R[R_count] = R_index +        R_index -= C + 1 +        R_count -= 1 +    else: +        R_index -= 1 +for i in range(K): +    if L[i] == R[i]: +        print((L[i] + 1))