#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
int N, K, S;
int main() {
  cin >> N >> K >> S;
  if (S < 1000000000) {
    cout << S << " ";
    for (long long i = 0; i < (K - 1); ++i) cout << "0 ";
    for (long long i = 0; i < (N - K); ++i) cout << 1000000000 << " ";
    return 0;
  } else {
    cout << S << " ";
    for (long long i = 0; i < (K - 1); ++i) cout << "0 ";
    for (long long i = 0; i < (N - K); ++i) cout << 999999999 << " ";
    return 0;
  }
  return 0;
}
