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 LuaJIT (2.0.4) (judge verdict: Wrong Answer)

local n, k, c = io.read("*n", "*n", "*n", "*l")
local s = io.read()
local t = {}
local okday = {}
for i = 1, n do
  t[i] = s:sub(i, i) == "o"
  if t[i] then
    table.insert(okday, i)
  end
end
local score = {}
for i = 1, #okday do
  score[i] = 1
end
local curscore, curday = 1, okday[#okday]
for i = #okday - 1, 1, -1 do
  if okday[i] + c < curday then
    curday = okday[i]
    curscore = curscore + 1
  end
  score[i] = curscore
end
local scoreleft = {}
local scoreright = {}
if 0 < #score then
  local maxscore = score[1]
  for i = 1, maxscore do
    scoreleft[i] = 0
    scoreright[i] = 0
  end
  local prvscore = -1
  for i = 1, #score do
    local s = score[i]
    if s ~= prvscore then
      prvscore = s
      scoreleft[s] = i
    end
    scoreright[s] = i
  end
  -- print(table.concat(scoreleft, " "))
  -- print(table.concat(scoreright, " "))
end

local ret = {}
if score[1] == k then
  for iok = #okday, 1, -1 do
    local rem = k
    if iok ~= #okday then
      if k <= score[iok + 1] then break end
      rem = rem - score[iok + 1]
    end
    local s = score[iok]
    if scoreleft[s] == scoreright[s] then
      table.insert(ret, okday[iok])
    elseif s < k then
      local idx = scoreleft[s + 1]
      local prvday = okday[idx]
      local idx2 = scoreright[s]
      -- print(idx, prvday, idx2)
      if idx2 == iok and okday[idx2 - 1] <=prvday + c then
        table.insert(ret, okday[iok])
      end
    end
  end
end
table.sort(ret)
print(table.concat(ret, "\n"))