#include <bits/stdc++.h>
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int> > qu2;
priority_queue<int> pq;
static const int NIL = -1;
static const int INF = 1000000007;
deque<int> deq;
long long N, M, H, W, Q, B;
string S;
const long long MOD = (1e+9) + 7;
bool chmx(int &a, int b) {
  if (b > a) {
    a = b;
    return true;
  }
  return false;
}
bool chmn(int &a, int b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  int n, k, s;
  cin >> n >> k >> s;
  int A[n];
  for (int i = 1; i <= (int)(2 * (k - 1)); i++) {
    A[i - 1] = s / (k - 1);
  }
  for (int i = 2 * (k - 1); i < n; i++) {
    A[i] = 100000000;
  }
  for (int i = 0; i < (int)(n); i++) {
    cout << A[i] << ' ';
  }
  cout << endl;
  return 0;
}
