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 Rust (1.15.1) (judge verdict: Wrong Answer)

use std::vec::Vec;

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>().split_whitespace().map(|e| e.parse().ok().unwrap()).collect()
}

fn read_touple<T: std::str::FromStr + Copy>() -> (T, T, T) {
  let v: Vec<T> = read_vec();
  assert_eq!(v.len(), 3);
  (v[0], v[1], v[2])
}

fn main() {
    let (n, k, c) = read_touple::<usize>();
    let mut s: Vec<char> = read::<String>().chars().collect();

    let mut L = Vec::new();
    let mut R = Vec::new();

    let mut pre = 0;
    for i in 0..n {
      if s[i] == 'o' && i == 0 {
         L.push(i);
         pre = i; 
      } else if i > pre && i - pre > c && s[i] == 'o' {
        L.push(i);
        pre = i;
      }
    }

    s.reverse();
    pre = 0;
    for i in 0..n {
      if s[i] == 'o' && i == 0 {
         R.push(n-1-i);
         pre = i; 
      } else if i > pre && i - pre > c && s[i] == 'o' {
        R.push(n-1-i);
        pre = i;
      }
    }  
    R.reverse();
    //println!("{:?}", L);
    //println!("{:?}",R);
    if k == 1 && L.len() == R.len() && L.len() == 1 && L[0] == R[0] {
      println!("{}", L[0]+1);
      return
    } else if c == 0 && L.len() == R.len() && L.len() > 1 {
      return
    }
    for i in 0..std::cmp::min(L.len(), R.len()) {
      if L[i] == R[i] {
        println!("{}", L[i]+1);
      }
    }

}