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.42.0) (judge verdict: Accepted)

#![allow(
    non_snake_case,
    unused_variables,
    unused_assignments,
    unused_mut,
    dead_code
)]
//use permutohedron::LexicalPermutation as _;
use proconio::input;
use proconio::marker::Chars;
//use proconio::marker::Usize1;
//use std::collections::HashSet;
//use std::collections::HashMap;
//use std::collections::BTreeMap;
//use std::collections::VecDeque;
//use std::cmp::*;
//use std::num;

fn main() {
    input! {
        n:usize, k:usize,c:usize,s:Chars
    }
    let mut L: Vec<usize> = vec![0; k];
    let mut R: Vec<usize> = vec![0; k];
    let mut i = 0;
    for j in 0..k {
        loop {
            if s[i] != 'x' {
                L[j] = i;
                break;
            } else {
                i += 1;
                if i >= n {
                    // 働けるパターンが存在しないので、出力無し
                    return;
                }
            }
        }
        i += c + 1;
    }
    let mut i = n - 1;
    for j in (0..k).rev() {
        loop {
            if s[i] != 'x' {
                R[j] = i;
                break;
            } else {
                i -= 1;
            }
        }
        if j > 0 {
            i -= c + 1
        };
    }
    // println!("L:{:?}", L);
    //  println!("R:{:?}", R);
    for j in 0..k {
        if L[j] == R[j] {
            println!("{}", L[j] + 1);
        }
    }
}