/*

Author : AllKilled
Date   : 202001186 20:10:00 UTC+8

Website: https://atcoder.jp/contests/keyence2020
Contest: Keyence Programming Contest 2020.
Problem: Task C.
Result :

*/
#include<bits/stdc++.h>
using namespace std;

typedef long long LL;

const int S = 1000 * 1000 * 1000;
const LL MAXN = 1e6+7;

///--------------------------------------------///

int n, k, s, f[MAXN];

int main()
{
    cin >> n >> k >> s;
    if (k == 0) {
        s = s == S ? S - 1 : S;
        for (int i = 0; i < n; ++i) cout << s << " ";
    }
    else {
        for (int i = 0; i < n; ++i) {
            if (i < k) cout << s << " ";
            else cout << s == S ? S - 1 : S << " ";
        }
    }
    return 0;
}
