from fractions import gcd
from math import sqrt
n, k, s = map(int, input().split())

for i in range(2, s+1):
    if gcd(i, s) == 1:
        prime = i
        break

l = []
counter = 0
for _ in range(n):
    if counter < k:
        l.append(str(s))
        counter += 1
    else:
        l.append(str(prime))

print(" ".join(l))
