import Control.Monad
import Data.Maybe
import qualified Data.ByteString.Char8 as BS
import Data.List

readInt = fst . fromJust . BS.readInt
readIntList = map readInt . BS.words
getInt = readInt <$> BS.getLine
getIntList = readIntList <$> BS.getLine

main = do
    [n, k, c] <- getIntList
    s <- f . zip [1..] <$> getLine
    let ans = filter (\i -> length i == k) $ solve k c s
    let l = length ans
    mapM print (inter ans)

f [] = []
f ((i, b) : xs) | b == 'o' = i : (f xs)
                | otherwise = f xs

solve 0 _ _ = [[]]
solve _ _ [] = [[]]
solve k c (x : xs) = map (x :) (solve (k - 1) c (filter (> (x + c)) xs)) ++ solve k c xs

inter ans | length ans == 0 = []
          | length ans == 1 = head ans
          | otherwise = foldl1' intersect ans