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)

#![allow(unused_imports)]pub mod pcl{}
use std::io::stdin;
macro_rules ! eprintln { ( $ ( $ args : tt ) * ) => { { use std :: io :: prelude ::*; writeln ! ( std :: io :: stderr ( ) , $ ( $ args ) * ) . unwrap ( ) ; } } ; }
fn main() {
    let (n, k, c) = {
        let mut s = String::new();
        stdin().read_line(&mut s).unwrap();
        let sp: Vec<_> = s
            .split_whitespace()
            .map(|x| x.parse::<usize>().unwrap())
            .collect();
        (sp[0], sp[1], sp[2] + 1)
    };
    let works: Vec<_> = {
        let mut s = String::new();
        stdin().read_line(&mut s).unwrap();
        s.chars().map(|ch| ch == 'o').collect()
    };
    let mut after = Vec::new();
    let mut d = 0;
    for _ in 0..k {
        while !works[d] {
            d += 1;
        }
        after.push(d);
        d += c;
    }
    let mut before = Vec::new();
    let mut d = n - 1;
    for _ in 0..k {
        while !works[d] {
            d -= 1;
        }
        before.push(d);
        d = d.saturating_sub(c);
    }
    before.reverse();
    assert_eq!(after.len(), before.len());
    eprintln!("after: {:?}", after);
    eprintln!("before: {:?}", before);
    for i in 0..k {
        if before[i] == after[i] {
            println!("{}", before[i] + 1);
        }
    }
}