#include <bits/stdc++.h>
const int maxn = 200020;
const int inf = -0x3f3f3f;
using namespace std;
long long gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(int a, int b) { return gcd(a, b) / a * b; }
long long n, k, s;
long long a[maxn];
int main() {
  cin >> n >> k >> s;
  int l = s / 2;
  for (int i = 1; i <= k + 1; i++) {
    if (i % 2)
      a[i] = l;
    else
      a[i] = s - l;
  }
  int h = 100256;
  for (int j = k + 2; j <= n; j++, h++) a[j] = h;
  for (int i = 1; i <= n; i++) cout << a[i] << " ";
  return 0;
}
