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: Time Limit Exceeded)



import java.util.*;

public class Main {
    static class Solution {
        int n =0;
        int k=0;
        int c = 0;
        Set<Integer> set = new HashSet();
        public void find(String str, int n, int k, int c) {
            this.n = n;
            this.k = k;
            this.c = c;
            List<Integer> list = new ArrayList();
            int i=1;
            for(char ch : str.toCharArray()) {
                if(ch == 'o') {
                    list.add(i);
                }
                i++;
            }

            if(!generate(list, new HashSet(), 0, -1)) {
                System.out.println();
                return;
            }

            List<Integer> list1 = new ArrayList<Integer>(set);
            Collections.sort(list1);
            for(Integer val : list1) {
                System.out.println(val);
            }


        }

        boolean generate(List<Integer> list, HashSet hashSet, int index, int prev) {
            if(hashSet.size() == k) {
                if(set.size() == 0) {
                    set = new HashSet(hashSet);
                }
                Iterator it = hashSet.iterator();
                boolean found = false;
                Set<Integer> common = new HashSet();
                while(it.hasNext()) {
                    int val = (int)it.next();
                    if(set.contains(val)) {
                        found = true;
                        common.add(val);
                    }
                }
                set = new HashSet(common);
                if(found == false) {
                    return false;
                }
                return true;
            }
            if(index == list.size()) {
                return true;
            }

            for(int i=index; i<list.size(); i++) {
                int val = list.get(i);
                if(prev != -1) {
                    if(prev + c >= val) {
                        continue;
                    }
                }
                hashSet.add(val);
                if(!generate(list, hashSet, i+1, val)) {
                    return false;
                }
                hashSet.remove(val);
            }
            return true;
        }

    }

    public static void main(String[] args) {
        Solution sol = new Solution();
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int c = sc.nextInt();
        sc.nextLine();
        String str = sc.nextLine();
        sol.find(str, n, k, c);
    }
}