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: Runtime Error)

#include <bits/stdc++.h>
#define ll long long int
#define MOD1        1000000007
#define MOD2        998244353
#define BOOST       ios_base::sync_with_stdio(false); cin.tie(NULL)

using namespace std;

ll n, k, c;
string s;
vector<vector<ll> >ans;
vector<ll> row;
void backtrack(ll pos, ll daysLeft)
{
    if(daysLeft == 0)
    {
        ans.push_back(row);
        return;
    }
    if(pos >= n)
        return;
    if(s[pos] == 'x')
        backtrack(pos+1, daysLeft);
    else
    {
        row.push_back(pos);
        backtrack(pos+c+1, daysLeft-1);
        row.pop_back();
        backtrack(pos+1, daysLeft);
    }
}

void solve()
{
    cin >> n >> k >> c >> s;
    backtrack(0, k);
    map<ll, ll> days;
    for(auto i: ans)
    {
        for(auto j : i)
        {
            if(days.find(j) == days.end())
                days.insert({j, 1});
            else
                days[j]++;
            //cout << j + 1 << ", ";
        }
        //cout << "\n";
    }
    for(auto i: days)
    {
        if(i.second == ans.size())
            cout << i.first + 1 << "\n";
        //cout << i.first << " = " << i.second << "\n";
    }
    //cout << days.size();
}


int main()
{
	// #ifndef ONLINE_JUDGE
 //    freopen("input.txt", "r", stdin);
 //    freopen("output.txt", "w", stdout);
	// #endif

    ll t = 1;
    //cin >> t;
    while(t--)
        solve();

    return 0;
}