#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using ul = unsigned long;
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;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
const int dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
inline bool inside(int y, int x, int H, int W) {
  return (y >= 0 && x >= 0 && y < H && x < W);
}
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, k, s;
  cin >> n >> k >> s;
  int len = n - (k - 1);
  vi b(len);
  for (int i = (int)(0); i < (int)(len); ++i) {
    if (i == len - 1)
      b[i] = s - s / len * (len - 1);
    else
      b[i] = s / len;
  }
  if (k == 0) {
    if (s < 100000) {
      for (int i = (int)(0); i < (int)(n); ++i) {
        cout << 100000;
        if (i != n - 1) cout << " ";
      }
      cout << endl;
      return 0;
    } else if (s == 100000) {
      for (int i = (int)(0); i < (int)(n); ++i) {
        if (i != n - 1)
          cout << 1;
        else
          cout << 10;
        if (i != n - 1) cout << " ";
      }
      cout << endl;
      return 0;
    } else {
      for (int i = (int)(0); i < (int)(n); ++i) {
        cout << 1;
        if (i != n - 1) cout << " ";
      }
      cout << endl;
      return 0;
    }
  }
  for (int i = (int)(0); i < (int)(n); ++i) {
    cout << b[i % len];
    if (i != n - 1) cout << " ";
  }
  cout << endl;
}
