#include <iostream>
#include <algorithm>
constexpr int N = 100'000, INF = 1'000'000'000;
int n, k, s;
int a[N];
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cin >> n >> k >> s;
    for (int i = 0; i < k; ++i)
        a[i] = s;
    if (k < n) {
        if (s == INF) {
            a[k] = s - 1;
        } else {
            a[k] = s + 1;
        }
    }
    for (int i = 0; i < n; ++i)
        std::cout << a[i] << " \n"[i == n - 1];
    return 0;
}