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 Go (1.6) (judge verdict: Accepted)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func main() {
	sc.Split(bufio.ScanWords)
	sc.Buffer([]byte{}, 1000000)
	N, K, C := getInt(), getInt(), getInt()
	s := []byte(getString())

	a := make([][]int, 2)
	sum := [2]int{0, 0}
	for ri := 0; ri < 2; ri++ {
		a[ri] = make([]int, N)
		c := 0
		cnt := 1
		for i := 0; i < N; i++ {
			// out(i, c, s[i])
			if c <= 0 && s[i] == 'o' {
				a[ri][i] = cnt
				cnt++
				c = C + 1
			}
			c--
		}
		sum[ri] = cnt - 1
		for i := 0; i < N/2; i++ {
			s[i], s[N-1-i] = s[N-1-i], s[i]
		}
	}

	// out(a[0])

	for i := 0; i < N/2; i++ {
		j := N - 1 - i
		a[1][i], a[1][j] = a[1][j], a[1][i]
	}

	// out(a[1])
	// out(sum)
	if sum[0] > K && sum[1] > K {
		return
	}

	for i := 0; i < N; i++ {
		if a[0][i] == 0 || a[1][i] == 0 {
			continue
		} else {
			out(i + 1)
		}
	}

}