import Control.Monad
import qualified Data.ByteString.Char8 as BS
import Data.List
import Data.Maybe
import Data.Ord
import qualified Data.Vector as VC
import qualified Data.Vector.Mutable as VM

readNums :: IO [Integer]
readNums = map (fst . fromJust . BS.readInteger) . BS.words <$> BS.getLine

readNumLists :: Int -> IO [[Integer]]
readNumLists n = replicateM n (map (fst . fromJust . BS.readInteger) . BS.words <$> BS.getLine)

readStrings :: IO [String]
readStrings = map BS.unpack . BS.words <$> BS.getLine

readStringLists :: Int -> IO [[String]]
readStringLists n = replicateM n (map BS.unpack . BS.words <$> BS.getLine)

toTuple :: [a] -> (a, a)
toTuple (x:y:_) = (x, y)

main :: IO ()
main = do
  (n:k:s:_) <- readNums
  print $ solve (fromIntegral n) (fromIntegral k) s

solve n k s = take (k + 1) (cycle [1, s - 1]) ++ replicate (n - k - 1) 0
--  (n:_) <- readNums
--  xl <- map toTuple <$> readNumLists (fromIntegral n)
--  print $ solve n xl
--
--solve :: Num a => a -> [(a, a)] -> a
--solve n xl = 1
--  where
--    f :: Num a => [(a, a)] -> [(a, a)] -> [(a, a)]
--    f acc xss@(x1:x2:x3:xs)
--      | length xss == 2 = acc ++ [x2]
--      | isCommon x1 x2 && isCommon x2 x3 = f acc (tail xss)
--      | otherwise = f (acc ++ [x2]) (tail xss)
--    isCommon a b
--      | distance >= armDistance = False
--      | otherwise = True
--      where
--        distance = fst b - fst a
--        armDistance = snd a + snd b