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: Accepted)

use std::collections::VecDeque;

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(|s| s.parse().ok().unwrap())
        .collect()
}

fn main() {
    let input = read_vec::<usize>();
    let (n, k, c) = (input[0], input[1], input[2]);
    let s = read::<String>().chars().collect::<Vec<_>>();

    let mut skip = 0;
    let mut l: Vec<usize> = vec![];
    let mut r: VecDeque<usize> = VecDeque::new();

    for (i, v) in s.iter().enumerate() {
        if skip > 0 {
            skip -= 1;
            continue;
        }
        if l.len() == k {
            break;
        }
        match *v {
            'o' => {
                l.push(i);
                skip = c;
            },
            'x' => {},
            _ => {
                println!("error");
            }
        }
    }
    skip = 0;
    for (i, v) in s.iter().enumerate().rev() {
        if skip > 0 {
            skip -= 1;
            continue;
        }
        if r.len() == k {
            break;
        }
        match *v {
            'o' => {
                r.push_front(i);
                skip = c;
            },
            'x' => {},
            _ => {
                println!("error");
            }
        }
    }

    let len = std::cmp::min(l.len(), r.len());    

    for i in 0..len {
        if l[i] == r[i] {
            println!("{}", l[i]+1);
        }
    }

}