#include <bits/stdc++.h>
using namespace std;
int n, d, l;
int main() {
  cin.sync_with_stdio(0);
  cin >> n >> d >> l;
  int pos = n / 2 + n % 2, neg = n - pos;
  for (int i = -20000; i <= 20000; i++) {
    int sumpos = i;
    int sumneg = sumpos - d;
    int singleneg = sumneg / neg, modneg = sumneg - singleneg * neg;
    int singlepos = sumpos / pos, modpos = sumpos - singlepos * pos;
    if (singleneg + (modneg > 0) <= l && singleneg >= 1 && singleneg <= l &&
        singleneg + (modneg > 0) >= 1 && singlepos >= 1 && singlepos <= l &&
        singlepos + (modpos > 0) <= l) {
      for (int j = 1; j <= n; j++)
        if (j % 2 == 1) {
          printf("%d ", singlepos + (modpos > 0));
          modpos--;
        } else {
          printf("%d ", singleneg + (modneg > 0));
          modneg--;
        }
      printf("\n");
      return 0;
    }
  }
  cout << -1 << endl;
  return 0;
}
