#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int read() {
  int s = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * f;
}
long long arr[MAXN];
int main() {
  long long n, k, s;
  while (cin >> n >> k >> s) {
    memset(arr, 0, sizeof(arr));
    if (s % 2) {
      if (n > 1) {
        if (k >= 1) {
          arr[1] = (s / 2);
          arr[2] = (s + 1) / 2;
          k--;
          int cnt = 3;
          while (k > 1) {
            arr[cnt] = arr[cnt - 2];
            k--;
            cnt++;
          }
          if (k == 1)
            arr[cnt++] = s;
          else
            arr[cnt++] = ++s;
          for (int i = cnt; i <= n; i++) {
            arr[i] = arr[i - 1] - 1;
          }
        } else {
          for (int i = 1; i <= n; i++) {
            arr[i] = s - i;
          }
        }
      } else {
        if (k == 0) {
          arr[1] = s + 1;
        } else {
          arr[1] = s;
        }
      }
    } else {
      if (n > 1) {
        if (k >= 1) {
          arr[1] = s / 2;
          arr[2] = s / 2;
          k--;
          int cnt = 3;
          while (k) {
            arr[cnt] = arr[cnt - 1];
            cnt++;
            k--;
          }
          for (int i = cnt; i <= n; i++) {
            arr[i] = arr[i - 1] - 1;
          }
        } else {
          for (int i = 1; i <= n; i++) {
            arr[i] = s - i;
          }
        }
      } else {
        if (k == 1)
          arr[1] = s;
        else
          arr[1] = s - 1;
      }
    }
    for (int i = 1; i <= n; i++) {
      cout << arr[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
