local mfl = math.floor

local n, k, c = io.read("*n", "*n", "*n", "*l")
local s = io.read()
local t = {}
for i = 1, n do
  if s:sub(i, i) == "o" then
    table.insert(t, i)
  end
end
local inf = 1000000007
local pre = {}
do
  local pos = 0
  local cur = -inf
  for i = 1, #t do
    if cur + c < t[i] then
      pos = pos + 1
      cur = t[i]
    end
    pre[i] = pos
  end
end
if k < pre[#t] then
  print("")
  os.exit()
end

local suf = {}
do
  local pos = k + 1
  local cur = inf
  for i = #t, 1, -1 do
    if t[i] < cur - c then
      pos = pos - 1
      cur = t[i]
    end
    suf[i] = pos
  end
end

-- print(table.concat(t, " "))
-- print(table.concat(pre, " "))
-- print(table.concat(suf, " "))

if #t == 1 then
  print(t[1])
  os.exit()
end
local ret = {}
-- 1
if pre[1] ~= pre[2] or suf[1] ~= suf[2] then
  table.insert(ret, t[1])
end
for i = 2, #t - 1 do
  if pre[i - 1] + 2 == pre[i + 1] then
    table.insert(ret, t[i])
  elseif suf[i - 1] + 2 == suf[i + 1] then
    table.insert(ret, t[i])
  end
end
-- last
if pre[#t - 1] ~= pre[#t] or suf[#t - 1] ~= suf[#t] then
  table.insert(ret, t[#t])
end
print(table.concat(ret, "\n"))
