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 Python (3.4.3) (judge verdict: Time Limit Exceeded)

import itertools

from sys import stdin
import sys
sys.setrecursionlimit(10**8)

def nextLine(): return next(stdin)
def nextStrList(): return nextLine().split()
def nextIntList(): return [int(_) for _ in nextStrList()]


def ox(s, i):
	return s[i]=="o"


def main():
	n,k,c=nextIntList()
	s=nextLine()
	
	height=(c+1)*(k-1)+1
# 	print("height",height)
# 	print(n,k,c)
# 	print(s)
	
	record={}
	for i0 in range(height):
		for i1 in range(n-height+i0+1):
			r=[]
			if i0==0:
				if ox(s,i1):
					r.append([i1])
			else:
				if i0%(c+1)==0: #o
					if ox(s, i1) and (i0-1, i1-1) in record:
						r=list(record[i0-1,i1-1])
						for i,ri in enumerate(r):
							if len(ri)<k:
								ri=list(ri)
								ri.append(i1)
								r[i]=ri
				elif i0%(c+1)==c: #last x
					r2=[]
					if (i0-1, i1-1) in record:
						r2.append(record[i0-1, i1-1])
					if (i0, i1-1) in record:
						r2.append(record[i0, i1-1])
					
					if len(r2)==1:
						r=r2[0]
					elif len(r2)==2:
						rSet=set()
						for r01 in r2:
							for ri in r01:
								rSet.add(tuple(ri))
						r=[list(ri) for ri in rSet]
				else:
					if (i0-1, i1-1) in record:
						r=record[i0-1,i1-1]
			
			if len(r)>0:
				record[i0,i1]=r

	s=None
	i0=height-1
	for i1 in range(height-1, n):
		if (i0,i1) in record:
			for r in record[i0,i1]:
				if len(r)==k:
					if s is None:
						s=set(r)
					s=s&set(r)
					if len(s)==0:
						sys.exit(0)
	
	for i in sorted(s):
		print(i+1)
	
	
if __name__=="__main__":
	main()