#include <bits/stdc++.h>
using namespace std;
long long ans;
int N, K, S, cur, num;
void solve() {
  cur = N - K + 1;
  while (S % cur != 0) {
    cur--;
  }
  num = S / cur;
  cur += K - 1;
  for (int i = 0, i_len = (N); i < i_len; ++i) {
    if (i < cur)
      cout << num;
    else
      cout << 1;
    if (i == N - 1)
      cout << endl;
    else
      cout << " ";
  }
}
int main() {
  cin >> N >> K >> S;
  solve();
}
