Problem:
Score : 500 points

Problem Statement

Takahashi has decided to work on K days of his choice from the N days starting with tomorrow.

You are given an integer C and a string S. Takahashi will choose his workdays as follows:

After working for a day, he will refrain from working on the subsequent C days.

If the i-th character of S is x, he will not work on Day i, where Day 1 is tomorrow, Day 2 is the day after tomorrow, and so on.

Find all days on which Takahashi is bound to work.

Constraints

1 \leq N \leq 2 \times 10^5

1 \leq K \leq N

0 \leq C \leq N

The length of S is N.

Each character of S is o or x.

Takahashi can choose his workdays so that the conditions in Problem Statement are satisfied.

Input

Input is given from Standard Input in the following format:

N K C
S

Output

Print all days on which Takahashi is bound to work in ascending order, one per line.

Sample Input 1

11 3 2
ooxxxoxxxoo

Sample Output 1

6

Takahashi is going to work on 3 days out of the 11 days. After working for a day, he will refrain from working on the subsequent 2 days.

There are four possible choices for his workdays: Day 1,6,10, Day 1,6,11, Day 2,6,10, and Day 2,6,11.

Thus, he is bound to work on Day 6.

Sample Input 2

5 2 3
ooxoo

Sample Output 2

1
5

There is only one possible choice for his workdays: Day 1,5.

Sample Input 3

5 1 0
ooooo

Sample Output 3

There may be no days on which he is bound to work.

Sample Input 4

16 4 3
ooxxoxoxxxoxoxxo

Sample Output 4

11
16

Solution in PyPy3 (2.4.0) (judge verdict: Wrong Answer)

# from heapq import heapify, heappop, heappush
# from bisect import bisect_left, bisect_right
# from collections import defaultdict
# import sys
# input = lambda: sys.stdin.readline().rstrip()
# sys.setrecursionlimit(10**9)
# MOD = 10**9 + 7
inpl = lambda: list(map(int,input().split()))
N, K, C = inpl()
S = input()
Ws = []
next_w = [0]*N
prev = None
for i in range(N):
    if S[i] == 'o':
        Ws.append(i)
        if prev is not None:
            next_w[prev] = i
            prev = i
s = 0
m = -2
n = -1
best_until = [None] * N
for i in range(N):
    if i == m+1:
        s += 1
    if S[i] == 'o':
        n += 1
        if i > m:
            best_until[n] = (s,1,n)
        elif n > 0:
            m = i + C
            best_until[n] = (s,0,best_until[n-1][2])
        else:
            m = i + C
            best_until[n] = (s,0,None)

w = 0
m = N
best_from = [None]*N
for i in range(N-1,-1,-1):
    if i < m and S[i] == 'o':
        w += 1
        m = i - C
    best_from[i] = w

for i, w in enumerate(Ws):
    s, c, b = best_until[i]
    if c == 1:
        if i == 0:
            s, c, b = 0, 0, 0
            wb = -1
        else:
            s, c, b = best_until[i-1]
            if b == None:
                wb = None
            else:
                wb = Ws[b]
    else:
        if b is None:
            wb = -1
        else:
            wb = Ws[b]

    if wb < N - 1:
        wf = best_from[wb+1]
    else:
        wf = 0
    print(wf, s)
    if wf + s < K:
        print(w+1)