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 C# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		var ca = S.ToCharArray().ToList();
		for(int i=0;i<N;i++) ca.Add('x');
		
		int NN = ca.Count;
		int[] dp1 = new int[NN + 1];
		for(int i=0;i<NN;i++){
			dp1[i + 1] = Math.Max(dp1[i + 1], dp1[i]);
			if(ca[i] == 'o'){
				dp1[i + C] = Math.Max(dp1[i + C], dp1[i] + 1);
			}
		}
		if(dp1[NN] > K){
			return;
		}
		
		
		int[] dp2 = new int[NN + 1];
		for(int i=NN;i>0;i--){
			dp2[i-1] = Math.Max(dp2[i-1], dp2[i]);
			if(i - C >= 0 && ca[i - C] == 'o'){
				dp2[i - C] = Math.Max(dp2[i - C],dp2[i] + 1);
			}
		}
//Console.WriteLine(String.Join(" ",dp1));
//Console.WriteLine(String.Join(" ",dp2));
		
		List<int> ans = new List<int>();
		for(int i=0;i<N;i++){
			if(S[i] == 'x') continue;
			if(dp1[i + C - 1] + dp2[i + 1] >= K) continue;
			ans.Add(i + 1);

		}
		
		foreach(var n in ans) Console.WriteLine(n);
		
		
	}
	int N,K,C;
	String S;
	public Sol(){
		var d = ria();
		N = d[0]; K = d[1]; C = d[2];
		S = rs();
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}