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

def gcd(a,b):
    c = 1
    a,b = max(a,b),min(a,b)
    while c != 0:
        c = a%b
        a,b = b,c
    return a

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

l = []
counter = 0
for i in range(n):
    if counter < k:
        print(s, end="")
        counter += 1
    else:
        print(prime, end="")

    if i != n-1:
        print(" ", end="")
    else:
        print()

    


