#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, d, l;
  cin >> n >> d >> l;
  int np = (n + 1) / 2;
  int nn = n / 2;
  int maxsum = np * l - nn * 1;
  int minsum = np * 1 - nn * l;
  if (d < minsum || d > maxsum) {
    cout << -1;
    return 0;
  }
  int sp = np * 1;
  int sn = nn * 1;
  d -= sp;
  d += sn;
  if (d > 0) {
    sp += d;
  } else if (d < 0) {
    sn += -d;
  }
  int ans[n];
  for (int i = 0; i < n; ++i) {
    ans[i] = 1;
    if (i % 2 == 0) {
      sp--;
    } else {
      sn--;
    }
  }
  for (int i = 0; i < n; ++i) {
    if (i % 2 == 0) {
      int t = 0;
      if (ans[i] + sp >= l) {
        t = l - ans[i];
      } else if (sp > 0) {
        t = sp;
      }
      sp -= t;
      ans[i] += t;
    } else {
      int t = 0;
      if (ans[i] + sn >= l) {
        t = l - ans[i];
      } else {
        t = sn;
      }
      sn -= t;
      ans[i] += t;
    }
  }
  for (int i = 0; i < n; ++i) {
    cout << ans[i] << " ";
  }
  return 0;
}
