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: # -*- coding: utf-8 -*-
  
  import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  def list4d(a, b, c, d, e):
      return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
  
  
  def ceil(x, y=1):
      return int(-(-x // y))
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST(N=None):
      return list(MAP()) if N is None else [INT() for i in range(N)]
  
  
  def Yes():
      print("Yes")
  
  
  def No():
      print("No")
  
  
  def YES():
      print("YES")
  
  
  def NO():
      print("NO")
  
  
  sys.setrecursionlimit(10**9)
  INF = float("inf")
  MOD = 10**9 + 7
  
  N, K, S = MAP()
  
  acc1 = [0] * (N - K + 1)
  acc2 = [0] * K
  for i in range(K):
      acc2[i] = S * (i + 1)
  acc = acc1 + acc2
  
  A = [0] * N
  for i in range(N - 1, -1, -1):
      A[i] = acc[i + 1] - acc[i]
  
  print(*A)
  
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"}]