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)

fn main() {
    let (n, k, c): (usize, usize, usize) = (read::<usize>(), read::<usize>(), read::<usize>());
    let s: Vec<char> = read::<String>().chars().collect();
    let mut memol = vec![0; n];
    let mut memor = vec![std::usize::MAX; n];
    let mut tmp = 0;
    let mut i = 0;
    while i < n && tmp < k {
        if s[i] == 'o' {
            memol[i] = tmp + 1;
            tmp += 1;
            i += c + 1;
        } else {
            i += 1;
        }
    }
    i = n - 1;
    tmp = k;
    while tmp > 0 {
        if s[i] == 'o' {
            memor[i] = tmp;
            tmp -= 1;
            match i.checked_sub(c + 1) {
                Some(v) => i = v,
                None => break,
            }
        } else {
            match i.checked_sub(1) {
                Some(v) => i = v,
                None => break,
            }
        }
    }
    let mut ans = vec![];
    for i in 0..n {
        if memor[i] == memol[i] {
            ans.push(i + 1);
        }
    }

    for a in ans {
        println!("{}", a);
    }
}

// =========
#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet};
#[allow(unused_imports)]
use std::process::exit;

#[allow(dead_code)]
const MOD: usize = 1000000007;

fn read<T: std::str::FromStr>() -> T {
    use std::io::Read;
    let stdin = std::io::stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

// =========