#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
constexpr long long mod = 1e9 + 7;
constexpr long long INF = mod * mod;
constexpr int MAX = 1000010;
int main() {
  int n, K, S;
  scanf("%d%d%d", &n, &K, &S);
  vector<long long> sum, sum_back;
  long long cur = 0;
  for (int((i)) = (0); ((i)) < ((K)); ++((i))) {
    sum.push_back(cur);
    sum_back.push_back(cur + S);
    ++cur;
    if (cur == sum_back[0]) break;
  }
  for (int x : sum_back) sum.push_back(x);
  sum.resize(n + 1, -1);
  long long dummy = (S == 1000000000 ? 1 : 1000000000);
  for (int((i)) = (0); ((i)) < ((n + 1)); ++((i)))
    if (sum[i] < 0) sum[i] = sum[i - 1] + dummy;
  for (int((i)) = (0); ((i)) < ((n)); ++((i)))
    printf("%lld ", sum[i + 1] - sum[i]);
}
