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 Ruby (2.3.3) (judge verdict: Wrong Answer)

n, k, c = gets.split.map(&:to_i)
s = gets.chomp!.chars

memo = []
s.each_with_index do |ch, i|
    if ch == "o"
        memo << i
    end
end

# 適当に一つみつける
# (適当に見つけたもの以外は消えても何も問題がない)
memo_c = memo.dup
x = memo_c.shift
ans = [x]
(k - 1).times do |i|
    t2 = memo_c.bsearch{|t| t > x + c }
    ans << t2
    x = t2
end

# 後ろから適当に見つける
memo_c2 = memo.dup.map{|x| -x }
memo_c2.sort!
x2 = memo_c2.shift
ans2 = [x2]
(k - 1).times do |i|
    t2 = memo_c2.bsearch{|t| t > x2 + c }
    ans2 << t2
    x2 = t2
end

answers = {}
ans.each do |i|
    answers[i] ||= 0
    answers[i] += 1
end
ans2.each do |i|
    answers[-i] ||= 0
    answers[-i] += 1
end

answers.sort.each do |a, cnt|
    if cnt > 1
        puts a + 1
    end
end