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++ (GCC 5.4.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
inline long long read(){
	register long long x=0;
	register bool f=0;
	register char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-') f=1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=(x<<3)+(x<<1)+c-48;
		c=getchar();
	}
	return f?-x:x;
}
char cr[200];int tt;
inline void print(register long long x,register char k='\n') {
    if(!x) putchar('0');
    if(x < 0) putchar('-'),x=-x;
    while(x) cr[++tt]=x%10+'0',x/=10;
    while(tt) putchar(cr[tt--]);
    putchar(k);
}
const int maxn=233333;
int n;
int k,c,f[maxn],g[maxn];
char s[maxn];
bool v1[maxn],v2[maxn];
int main(){
	n=read();k=read();c=read();
	gets(s+1);
	for(int i=1;i<=n;i++){
		f[i]=s[i]=='o'?i:f[i-1];
	}
	g[n+1]=n+1;
	for(int i=n;i>=1;i--){
		g[i]=s[i]=='o'?i:g[i+1];
	}
	int mx1=0,mx2=0,t=1;
	while(1<=t&&t<=n){
		t=g[t];
		if(1<=t&&t<=n){
			v1[t]=true;
			t+=c+1;
			mx1++;
		}
	}
	t=n;
	while(1<=t&&t<=n){
		t=f[t];
		if(1<=t&&t<=n){
			v2[t]=true;
			t-=c+1;
			mx2++;
		}
	}
	if(max(mx1,mx2)>k) return 0;
	for(int i=1;i<=n;i++) if(v1[i]&&v2[i]) print(i);
	return 0;
}