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::str::FromStr;
use std::fmt::Debug;
use std::cmp;
#[allow(dead_code)]
fn read_as_vec<T>() -> Vec<T>
where T: FromStr, <T as FromStr>::Err : Debug{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().split_whitespace().map(|c| T::from_str(c).unwrap()).collect()

}

#[allow(dead_code)]
fn read_as_string() -> String{
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).unwrap();
    s.trim().to_string()
}

fn main(){
    let line = read_as_vec::<usize>();
    let (n, k, c) = (line[0], line[1], line[2]);
    let s = read_as_string().chars().collect::<Vec<char>>();

    let mut day: usize = 0;
    let mut left_workdays = vec![false;n];
    let mut num_workday: usize = 0;

    while num_workday < k{
        if s[day] == 'o'{
            num_workday += 1;
            left_workdays[day] = true;
            day += c+1;
        }else{
            day += 1;
        }
    }
    // dbg!(right);
    // dbg!(&left_workdays);

    let mut day: usize = n-1;
    let mut num_workday: usize = 0;
    let mut right_workdays = vec![false;n];

    while num_workday < k{
        if s[day] == 'o'{
            num_workday += 1;
            right_workdays[day] = true;
            if day >= c+1{
                day -= (c+1);
            }else{
                break;
            }
        }else{
            day -= 1;
        }
    }

    // dbg!(left);
    // dbg!(&right_workdays);

    for i in 0..left_workdays.len(){
        if left_workdays[i] && right_workdays[i]{
            println!("{}", i+1);
        }
    }
}