n, k, s = map(int, input().split())

def sieve(n):
    prime = [True] * (n + 1)
    prime[0] = prime[1] = False
    i = 2
    while i * i <= n:
        if prime[i]:
            for j in range(i * i, n + 1, i):
                prime[j] = False
        i += 1
    return [i for i in range(i) if prime[i]]

primes = sieve(1000)
a = s
b = None
for p in primes:
    if s % p != 0:
        b = p
        break
print([a] * k + [b] * (n - k))
