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: n, ko, aim = map(int, input().split())
  l = [aim for i in range(ko)]
  d = 10**9 - 1 if aim == 10**9 else 10**9
  f = [d for i in range(n - ko)]
  ll = l + f
  print(*ll, sep=" ")
  
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"}]