#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const long long INFL = 9 * 1e18;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T>
void print(T&& x) {
  cout << x << endl;
}
long long inline digit(long long num) {
  int tmp = 0;
  while (num) {
    tmp++;
    num /= 10;
  }
  return tmp;
}
template <typename T>
inline T digitSum(T num) {
  T sum = 0;
  while (num) {
    sum += num % 10;
    num /= 10;
  }
  return sum;
}
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
  T g = gcd(a, b);
  return a / g * b;
}
template <typename T>
inline T power(T a, T b) {
  T tmp = 1;
  for (int i = 0; i < ((int)(b)); ++i) {
    tmp *= a;
  }
  return tmp;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
bool isPrime(long long n);
vector<long long> primes(long long n);
int ctoi(char c) { return c - '0'; }
const long long COM_MAX = (long long)(1e6 + 100);
vector<long long> fac(COM_MAX), finv(COM_MAX), inv(COM_MAX);
void comb_init();
long long comb(long long n, long long k);
void dfs(int n, int now, string s) {
  if (n == now)
    cout << s << endl;
  else
    for (int i = 0; i < ((int)(3)); ++i) dfs(n + 1, now, s + (char)('a' + i));
}
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  for (int i = 0; i < ((int)(k)); ++i) {
    cout << s << ' ';
  }
  for (int i = 0; i < ((int)(n - k)); ++i) {
    if (i == 0) {
      if (s == 1000000000)
        cout << s - 1 << " ";
      else
        cout << s + 1 << " ";
    } else
      cout << 0 << " \n"[i == n - k - 1];
  }
  return 0;
}
void comb_init() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < COM_MAX; ++i) {
    fac[i] = fac[i - 1] * i % INF;
    inv[i] = INF - inv[INF % i] * (INF / i) % INF;
    finv[i] = finv[i - 1] * inv[i] % INF;
  }
}
long long comb(long long n, long long k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % INF) % INF;
}
bool isPrime(long long n) {
  for (int i = 2; n >= i * i; ++i) {
    if (!(n % i)) return false;
  }
  return true;
}
vector<long long> primes(long long n) {
  vector<long long> v;
  for (long long i = 2; i * i <= n; ++i) {
    while (n % i == 0) {
      n /= i;
      v.push_back(i);
    }
  }
  if (n != 1) v.push_back(n);
  return v;
}
