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

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author lynmisakura
 */

#include <iostream>
#include <fstream>

/*
 *  author : lynmisakura
 *  stay hungry, stay foolish, stay home.
 */
#include <iostream>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>

#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>

using namespace std;
typedef long long ll;

class EYutori {
public:
    int n,k,c;
    string s;
    vector<int> L,R;
	void solve(std::istream& cin, std::ostream& cout) {
	   cin >> n >> k >> c >> s;
	   L.resize(n,-1),R.resize(n,-1);
	   int current = 0;
	   int job_id = 0;
	   while(current < n){
	       if(s[current] == 'o'){
	          L[current] = ++job_id;
	          current += (c + 1);
	       }else{
	           current++;
	       }
	   }
	   if(job_id > k)return;
	   current = n - 1;
	   while(current >= 0){
	       if(s[current] == 'o'){
	          R[current] = job_id--;
	          current -= (c + 1);
	       }else{
	           current--;
	       }
	   }

	   vector<int> ans;
	   for(int i = 0;i < n;i++){
	       if(L[i] > 0 && L[i] == R[i]){
	           ans.push_back(i+1);
	       }
	   }
	   for(auto i : ans)cout << i << '\n';
	}
};


int main() {
	EYutori solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}