#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
long long mod = 1000000007;
int main() {
  long long N, K, S;
  cin >> N >> K >> S;
  long long s[N + 1];
  long long A[N + 1];
  A[1] = 1;
  s[0] = 0;
  s[1] = 1;
  for (int i = 2; i <= N; i++) {
    if (K != 0) {
      s[i] = s[i - 2] + S;
      A[i] = s[i] - s[i - 1];
      K--;
    } else {
      s[i] = s[i - 2] + S;
      if (S - i > 0)
        A[i] = s[i] - s[i - 1] + (S - i);
      else if (S - i == 0) {
        A[i] = s[i] - s[i - 1] - (S - i + 1);
      } else {
        A[i] = s[i] - s[i - 1] - (S - i);
      }
    }
  }
  for (int i = 1; i <= N; i++) cout << A[i] << " ";
  return 0;
}
