MOD = 10 ** 9 + 7

INF = 10 ** 10

import sys

sys.setrecursionlimit(100000000)

dy = (-1,0,1,0)

dx = (0,1,0,-1)



def main():

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

    s = eval(input())



    cuml = [0] * (n + 1)

    cumr = [0] * (n + 1)

    idx = []



    for i in range(n):

        if s[i] == 'o':

            idx.append(i)

            cuml[i + 1] = cuml[max(i - c,0)] + 1

        else:

            cuml[i + 1] = cuml[i]

    

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

        if s[i] == 'o':

            cumr[i] = cumr[min(i + c + 1,n)] + 1

        else:

            cumr[i] = cumr[i + 1]

    

    ans = []

    #print(idx,cuml,cumr)

    if c != 0:

        for i in idx:

            flag = False

            for j in range(i - c,i):

                if cuml[max(j + 1,0)] + cumr[min(j + c + 1,n)] >= k:

                    flag = True

                    break



            if flag:

                continue

            else:

                ans.append(i + 1)

    else:

        for i in idx:

            if cuml[i] + cumr[i + 1] < k:

                ans.append(i + 1)

    

    for i in range(len(ans)):

        print((ans[i]))

 

if __name__ =='__main__':

    main()   

MOD = 10 ** 9 + 7

INF = 10 ** 10

import sys

sys.setrecursionlimit(100000000)

dy = (-1,0,1,0)

dx = (0,1,0,-1)



def main():

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

    s = input()



    R = [-1] * k

    L = [-1] * k

    day = INF

    cnt = 0

    for i in range(n):

        if s[i] == 'o':

            if day > c:

                L[cnt] = i

                cnt += 1

                if cnt == k:

                    break

                day = 1

            else:

                day += 1

        else:

            day += 1

    

    day = INF

    cnt = k - 1

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

        if s[i] == 'o':

            if day > c:

                R[cnt] = i

                cnt -= 1

                if cnt < 0:

                    break

                day = 1

            else:

                day += 1

        else:

            day += 1

    

    ans = []

    for j in range(k):

        if R[j] == L[j]:

            ans.append(R[j] + 1)



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



if __name__ =='__main__':

    main()  

MOD = 10**9 + 7
INF = 10**10
import sys

sys.setrecursionlimit(100000000)
dy = (-1, 0, 1, 0)
dx = (0, 1, 0, -1)


def main():
    n, k, c = list(map(int, input().split()))
    s = eval(input())
    cuml = [0] * (n + 1)
    cumr = [0] * (n + 1)
    idx = []
    for i in range(n):
        if s[i] == "o":
            idx.append(i)
            cuml[i + 1] = cuml[max(i - c, 0)] + 1
        else:
            cuml[i + 1] = cuml[i]
    for i in range(n - 1, -1, -1):
        if s[i] == "o":
            cumr[i] = cumr[min(i + c + 1, n)] + 1
        else:
            cumr[i] = cumr[i + 1]
    ans = []
    # print(idx,cuml,cumr)
    if c != 0:
        for i in idx:
            flag = False
            for j in range(i - c, i):
                if cuml[max(j + 1, 0)] + cumr[min(j + c + 1, n)] >= k:
                    flag = True
                    break
            if flag:
                continue
            else:
                ans.append(i + 1)
    else:
        for i in idx:
            if cuml[i] + cumr[i + 1] < k:
                ans.append(i + 1)
    for i in range(len(ans)):
        print((ans[i]))


if __name__ == "__main__":
    main()

MOD = 10**9 + 7
INF = 10**10
import sys

sys.setrecursionlimit(100000000)
dy = (-1, 0, 1, 0)
dx = (0, 1, 0, -1)


def main():
    n, k, c = map(int, input().split())
    s = input()
    R = [-1] * k
    L = [-1] * k
    day = INF
    cnt = 0
    for i in range(n):
        if s[i] == "o":
            if day > c:
                L[cnt] = i
                cnt += 1
                if cnt == k:
                    break
                day = 1
            else:
                day += 1
        else:
            day += 1
    day = INF
    cnt = k - 1
    for i in range(n - 1, -1, -1):
        if s[i] == "o":
            if day > c:
                R[cnt] = i
                cnt -= 1
                if cnt < 0:
                    break
                day = 1
            else:
                day += 1
        else:
            day += 1
    ans = []
    for j in range(k):
        if R[j] == L[j]:
            ans.append(R[j] + 1)
    print(*ans, sep="\n")


if __name__ == "__main__":
    main()

-    n, k, c = list(map(int, input().split())) -    s = eval(input()) -    cuml = [0] * (n + 1) -    cumr = [0] * (n + 1) -    idx = [] +    n, k, c = map(int, input().split()) +    s = input() +    R = [-1] * k +    L = [-1] * k +    day = INF +    cnt = 0 -            idx.append(i) -            cuml[i + 1] = cuml[max(i - c, 0)] + 1 +            if day > c: +                L[cnt] = i +                cnt += 1 +                if cnt == k: +                    break +                day = 1 +            else: +                day += 1 -            cuml[i + 1] = cuml[i] +            day += 1 +    day = INF +    cnt = k - 1 -            cumr[i] = cumr[min(i + c + 1, n)] + 1 +            if day > c: +                R[cnt] = i +                cnt -= 1 +                if cnt < 0: +                    break +                day = 1 +            else: +                day += 1 -            cumr[i] = cumr[i + 1] +            day += 1 -    # print(idx,cuml,cumr) -    if c != 0: -        for i in idx: -            flag = False -            for j in range(i - c, i): -                if cuml[max(j + 1, 0)] + cumr[min(j + c + 1, n)] >= k: -                    flag = True -                    break -            if flag: -                continue -            else: -                ans.append(i + 1) -    else: -        for i in idx: -            if cuml[i] + cumr[i + 1] < k: -                ans.append(i + 1) -    for i in range(len(ans)): -        print((ans[i])) +    for j in range(k): +        if R[j] == L[j]: +            ans.append(R[j] + 1) +    print(*ans, sep="\n")