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

s = eval(input())

left_dp = []

right_dp = []



i = 0

while len(left_dp)<k:

    if s[i] == "o":

        left_dp.append(i+1)

        i += c+1

    else: i += 1

        

i = n-1

while len(right_dp)<k:

    if s[i] == "o":

        right_dp.append(i+1)

        i -= c+1

    else: i -= 1



for i in range(k):

    if left_dp[i] == right_dp[k-i-1]:

        print((left_dp[i]))
n, k, c = map(int, input().split())

s = input()

dpl = []

dpr = []

ans = []

count = 0

i = 0

while count < k:

    if s[i]=="o":

        dpl.append(i)

        count += 1

        i += c+1

    else: i += 1

count = 0

i = n-1

while count < k:

    if s[i]=="o":

        dpr.append(i)

        count += 1

        i += -c-1

    else: i -= 1

dpr.sort()

for i in range(len(dpl)):

    if dpl[i] == dpr[i]: ans.append(dpl[i]+1)

print(*ans, sep="\n")

n, k, c = list(map(int, input().split()))
s = eval(input())
left_dp = []
right_dp = []
i = 0
while len(left_dp) < k:
    if s[i] == "o":
        left_dp.append(i + 1)
        i += c + 1
    else:
        i += 1
i = n - 1
while len(right_dp) < k:
    if s[i] == "o":
        right_dp.append(i + 1)
        i -= c + 1
    else:
        i -= 1
for i in range(k):
    if left_dp[i] == right_dp[k - i - 1]:
        print((left_dp[i]))

n, k, c = map(int, input().split())
s = input()
dpl = []
dpr = []
ans = []
count = 0
i = 0
while count < k:
    if s[i] == "o":
        dpl.append(i)
        count += 1
        i += c + 1
    else:
        i += 1
count = 0
i = n - 1
while count < k:
    if s[i] == "o":
        dpr.append(i)
        count += 1
        i += -c - 1
    else:
        i -= 1
dpr.sort()
for i in range(len(dpl)):
    if dpl[i] == dpr[i]:
        ans.append(dpl[i] + 1)
print(*ans, sep="\n")

-n, k, c = list(map(int, input().split())) -s = eval(input()) -left_dp = [] -right_dp = [] +n, k, c = map(int, input().split()) +s = input() +dpl = [] +dpr = [] +ans = [] +count = 0 -while len(left_dp) < k: +while count < k: -        left_dp.append(i + 1) +        dpl.append(i) +        count += 1 +count = 0 -while len(right_dp) < k: +while count < k: -        right_dp.append(i + 1) -        i -= c + 1 +        dpr.append(i) +        count += 1 +        i += -c - 1 -for i in range(k): -    if left_dp[i] == right_dp[k - i - 1]: -        print((left_dp[i])) +dpr.sort() +for i in range(len(dpl)): +    if dpl[i] == dpr[i]: +        ans.append(dpl[i] + 1) +print(*ans, sep="\n")