# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap

def c(A, S):
    a = 0
    for i, j in combinations_with_replacement(range(len(A)), r=2):
        if S == sum(A[i:j+1]):
            a += 1
    return a

@mt
def slv(N, K, S):
    A = [S] * K + [S+1] * (N-K)
    # assert c(A, S) == K
    return ' '.join(map(str, A))


def main():
    N, K, S = read_int_n()
    print(slv(N, K, S))

    # while True:
    #     N = random.randint(1, 5)
    #     K = random.randint(0, N)
    #     S = random.randint(1, 10)
    #     print(N, K, S)
    #     print(slv(N, K, S))




if __name__ == '__main__':
    main()
