output_description: Print a sequence satisfying the condition, in the following format:
  
      
      
      A_1 A_2 ... A_N
      
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K S
attempt: # 入力が10**5とかになったときに100ms程度早い
  import sys
  
  read = sys.stdin.readline
  
  
  def read_ints():
      return list(map(int, read().split()))
  
  
  def read_a_int():
      return int(read())
  
  
  def read_matrix(H):
      """
      H is number of rows
      """
      return [list(map(int, read().split())) for _ in range(H)]
  
  
  def read_map(H):
      """
      H is number of rows
      文字列で与えられた盤面を読み取る用
      """
      return [read()[:-1] for _ in range(H)]
  
  
  def read_col(H, n_cols):
      """
      H is number of rows
      n_cols is number of cols
  
      A列、B列が与えられるようなとき
      """
      ret = [[] for _ in range(n_cols)]
      for _ in range(H):
          tmp = list(map(int, read().split()))
          for col in range(n_cols):
              ret[col].append(tmp[col])
  
      return ret
  
  
  N, K, S = read_ints()
  INF = 10**9
  MIN = 1
  
  ans = []
  for _ in range(K):
      ans.append(S)
  
  if S != INF:
      for _ in range(N - K):
          ans.append(INF)
  else:
      for _ in range(N - K):
          ans.append(MIN)
  
  
  print(*ans)
  
problem_description: Statement
  
  Given are three integers N, K, and S.
  
  Find a sequence A_1, A_2, ..., A_N of N integers between 1 and 10^9
  (inclusive) that satisfies the condition below. We can prove that, under the
  conditions in Constraints, such a sequence always exists.
  
    * There are exactly K pairs (l, r) of integers such that 1 \leq l \leq r \leq N and A_l + A_{l + 1} + \cdots + A_r = S.
samples: [{"input": "4 2 3", "output": "1 2 3 4\n    \n\nTwo pairs (l, r) = (1, 2) and (3, 3) satisfy the condition in the statement.\n\n* * *"}, {"input": "5 3 100", "output": "50 50 50 30 70"}]