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: NKS = input().split(" ")
  N = int(NKS[0])
  K = int(NKS[1])
  S = int(NKS[2])
  out = ""
  other = 10**9 if S != 10**9 else (10**9) - 1
  for i in range(K):
      out += str(S) + " "
  for i in range(K, N):
      out += str(other) + ("" if i == N - 1 else " ")
  print(out)
  
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"}]