from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline


def lcm(a, b):
    return a * b / fractions.gcd(a, b)


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def modpow(a, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def modinv(a, mod):
    return modpow(a, mod - 2, mod)


def cnk(a, b):
    MOD = 10**9+7
    ret = 1
    for i in range(b):
        ret *= (a-i)
        ret %= MOD
        ret = ret * modinv(i+1, MOD) % MOD
    return ret




def main():
    n, k, s = map(int, input().split())
    if n == 1:
        print(s)
        exit()
    # elif k == 1:
    #     ansl = [10 ** 9] * n
    #     ansl[0] = s
    #     print(*ansl)
    #     exit()
    
    ansl = []
    if s == 10**9:
        ansl = [10 ** 9 - 1] * n
    else:
        ansl = [10**9]*n

    ansl[0] = 1
    ansl[1] = s - 1
    for i in range(k - 1):
        if i % 2 == 0:
            ansl[i+2] = 1
        else:
            ansl[i+2] = s - 1


    
    # v = n - k + 1
    # t = s // v
    # if t == 0:
    #     ansl = [0]*n


    #     ansl[0] = 1
    #     ansl[1] = s - 1
    #     for i in range(k - 1):
    #         if i % 2 == 0:
    #             ansl[i+2] = 1
    #         else:
    #             ansl[i+2] = s - 1
        
    #     for i in range(n):
    #         if ansl[i] == 0:
    #             ansl[i] = 10**9
            

    # else:
    #     t2 = s % v
    #     l = [t] * (v - 1) + [t + t2]
    #     ansl = []
    #     for i in range(n // len(l) + 1):
    #         ansl+=l
    
    
    
    print(*ansl[:n])

    


    


if __name__ == '__main__':
    main()


### FIXED CODE ###

from fractions import gcd
# from datetime import date, timedelta
# from heapq import *
import heapq
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline


def lcm(a, b):
    return a * b / fractions.gcd(a, b)


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


def factorize(n):
    fct = []  # prime factor
    b, e = 2, 0  # base, exponent
    while b * b <= n:
        while n % b == 0:
            n = n // b
            e = e + 1
        if e > 0:
            fct.append((b, e))
        b, e = b + 1, 0
    if n > 1:
        fct.append((n, 1))
    return fct


def is_prime(n):
    if n == 1:
        return False

    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False

    return True


def primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def modpow(a, n, mod):
    res = 1
    while n > 0:
        if n & 1:
            res = res * a % mod
        a = a * a % mod
        n >>= 1
    return res


def modinv(a, mod):
    return modpow(a, mod - 2, mod)


def cnk(a, b):
    MOD = 10**9+7
    ret = 1
    for i in range(b):
        ret *= (a-i)
        ret %= MOD
        ret = ret * modinv(i+1, MOD) % MOD
    return ret




def main():
    n, k, s = map(int, input().split())
    if n == 1:
        print(s)
        exit()
    # elif k == 1:
    #     ansl = [10 ** 9] * n
    #     ansl[0] = s
    #     print(*ansl)
    #     exit()
    
    
    ansl = []
    if s == 10**9:
        ansl = [10 ** 9 - 1] * n
    else:
        ansl = [10 ** 9] * n
    
    for i in range(k):
        ansl[i] = s


    # ansl[0] = 1
    # ansl[1] = s - 1
    # for i in range(k - 1):
    #     if i % 2 == 0:
    #         ansl[i+2] = 1
    #     else:
    #         ansl[i+2] = s - 1


    
    # v = n - k + 1
    # t = s // v
    # if t == 0:
    #     ansl = [0]*n


    #     ansl[0] = 1
    #     ansl[1] = s - 1
    #     for i in range(k - 1):
    #         if i % 2 == 0:
    #             ansl[i+2] = 1
    #         else:
    #             ansl[i+2] = s - 1
        
    #     for i in range(n):
    #         if ansl[i] == 0:
    #             ansl[i] = 10**9
            

    # else:
    #     t2 = s % v
    #     l = [t] * (v - 1) + [t + t2]
    #     ansl = []
    #     for i in range(n // len(l) + 1):
    #         ansl+=l
    
    
    
    print(*ansl[:n])

    


    


if __name__ == '__main__':
    main()