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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;

public class Main{
    static boolean[] isWork;
    static boolean[][] dp;
    public static void main(String[] args) {
        Scanner stdIn = new Scanner(System.in);

        int n = stdIn.nextInt();
        int k = stdIn.nextInt();
        int c = stdIn.nextInt();
        String s = stdIn.next();
        char[] cs = s.toCharArray();

        isWork = new boolean[n];
        for(int i=0; i<n; i++){
            isWork[i] = true;
        }
        
        dp = new boolean[n][k];

        for(int i=0; i<cs.length; i++){
            if(cs[i] != 'x'){
                ArrayList<Integer> list = new ArrayList<Integer>();
                list.add(i);
                ArrayList<Integer> ii = new ArrayList<Integer>();
                ArrayList<Integer> jj = new ArrayList<Integer>();                
                ii.add(i);
                jj.add(k-1);
                tansaku(cs, i, c, k-1, list, ii, jj);
            }
        }

        for(int i=0; i<n; i++){
            if(isWork[i]){
                System.out.print((i+1) + " ");
            }
        }
    }

    static void tansaku(char[] cs, int lastIdx, int c, int havetowork, ArrayList<Integer> list, ArrayList<Integer> ii, ArrayList<Integer> jj){
        if(havetowork == 0){
            int nextStart = 0;
            while(!list.isEmpty()){
                int item = list.remove(0);
                for(int i=nextStart; i<item; i++){
                    isWork[i] = false;
                }
                nextStart = item + 1;
            }
            for(int i=nextStart; i<cs.length; i++){
                isWork[i] = false;
            }

            while(!ii.isEmpty()){
                try{
                    dp[ii.remove(0)][jj.remove(0)] = true;
                }catch(Exception e){

                }
            }
            return;
        }

        if(dp[lastIdx][havetowork]){
            int nextStart = 0;
            while(!list.isEmpty()){
                int item = list.remove(0);
                for(int i=nextStart; i<item; i++){
                    isWork[i] = false;
                }
                nextStart = item + 1;
            }

            while(!ii.isEmpty()){
                try{
                    dp[ii.remove(0)][jj.remove(0)] = true;
                }catch(Exception e){

                }
            }
            return;
        }

        for(int i=lastIdx+1+c; i<cs.length; i++){
            if(cs[i] != 'x'){
                ArrayList<Integer> newlist = (ArrayList<Integer>) list.clone();
                newlist.add(i);
                ArrayList<Integer> newII = (ArrayList<Integer>) ii.clone();
                newII.add(i);
                ArrayList<Integer> newJJ = (ArrayList<Integer>) jj.clone();
                newJJ.add(havetowork-1);
                tansaku(cs, i, c, havetowork-1, newlist, newII, newJJ);
            }
        }
    }
}