#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline T gcd(T a, T b) {
  return __gcd(a, b);
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
long long modpow(long long a, long long n, long long temp) {
  long long res = 1, y = a;
  while (n > 0) {
    if (n & 1) res = (res * y) % temp;
    y = (y * y) % temp;
    n /= 2;
  }
  return res % temp;
}
long long getbit(long long j, long long i) { return ((i >> (j - 1ll)) & 1ll); }
long long ison(long long mask, long long pos) { return (mask & (1 << pos)); }
long long cbit(long long n) {
  long long k = 0;
  while (n) n &= (n - 1), k++;
  return k;
}
long long nbit(long long n) {
  long long k = 0;
  while (n) n /= 2, k++;
  return k;
}
long long mod = 1e9 + 7;
int sgn(long long x) { return x < 0 ? -1 : !!x; }
const double eps = 1e-7;
const double pi = acos(-1.0);
inline void inc(long long &x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
}
inline void dec(long long &x, long long y) {
  x -= y;
  if (x < 0) x += mod;
}
inline void chmax(long long &x, long long y) {
  if (y > x) x = y;
}
inline void mulm(long long &x, long long y) {
  x *= y;
  if (x >= mod) x -= mod;
}
long long xo(long long i) {
  if ((i & 3) == 0) return i;
  if ((i & 3) == 1) return 1;
  if ((i & 3) == 2) return i + 1;
  return 0;
}
long long ans[100005];
int main() {
  long long l, d, n, s, k, no, m, i, j, sc, n1, m1, n2, m2;
  cin >> n >> d >> l;
  long long p = (n + 1ll) / 2ll;
  long long neg = n / 2ll;
  if (d > (p * l - neg) || (d < (p - neg * l))) {
    cout << -1;
    return 0;
  }
  long long psum = 0;
  long long nsum = i;
  for (long long i = neg; i <= neg * l; i++) {
    long long preq = d + i;
    if ((d + i) >= p && (d + i) <= l * p) {
      nsum = i;
      psum = preq;
      break;
    }
  }
  long long ep = psum / p;
  psum %= p;
  for (long long i = 1; i <= n; i++)
    if (i % 2ll) ans[i] = ep;
  for (long long i = 1; i <= n; i++)
    if (i % 2 && psum > 0) ans[i]++, psum--;
  long long en = nsum / neg;
  nsum %= neg;
  for (long long i = 1; i <= n; i++)
    if (i % 2 == 0) ans[i] = en;
  for (long long i = 1; i <= n; i++)
    if (i % 2 == 0 && nsum > 0) ans[i]++, nsum--;
  for (long long i = 1; i <= n; i++) cout << ans[i] << " ";
}
