#include <bits/stdc++.h>
using namespace std;
const long long M = 1e7 + 7;
const long long N = 1e6 + 10;
const long long IM = 1e15 + 37;
const long double PI = 3.1415926535897932384;
void PV(vector<long long> v) {
  for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
void PVV(vector<pair<long long, long long> > v) {
  for (long long i = 0; i < v.size(); i++)
    cout << v[i].first << " " << v[i].second << "\n";
}
void PA(long long v[], long long n, long long x = 0) {
  for (long long i = x; i < n + x; i++) cout << v[i] << ' ';
  cout << "\n";
}
void IN(long long a[], long long n, long long x = 0) {
  for (long long i = x; i < n + x; i++) cin >> a[i];
}
inline void PP(long long n) { cout << n << " "; }
inline void PP(long long n, long long m) { cout << n << " " << m << "\n"; }
inline void PP(long long n, long long m, long long q) {
  cout << n << " " << m << " " << q << "\n";
}
inline void PP(long long n, long long m, long long q, long long u) {
  cout << n << " " << m << " " << q << " " << u << "\n";
}
inline void op() {}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  op();
  long long i, j, x, y, u, k, l;
  {
    i = j = x = y = u = k = l = 0;
    long long n, d;
    cin >> n >> d >> l;
    x = (n + 1) / 2;
    x = l * x - (n - x);
    y = x - (n - x) * l;
    x = (n + 1) / 2;
    vector<long long> v(n, 1);
    if (n % 2)
      y = 1;
    else
      y = 0;
    if (d == 0 && y == 0)
      PV(v);
    else if (d > 0) {
      y = d - y;
      for (i = 0; i < n; i += 2) {
        k = min(y, l - 1);
        y = y - k;
        v[i] += k;
        if (y == 0) break;
      }
      if (y)
        cout << (-1) << "\n";
      else
        PV(v);
    } else {
      d = -d;
      y = d + y;
      for (i = 1; i < n; i += 2) {
        k = min(y, l - 1);
        y = y - k;
        v[i] += k;
        if (y == 0) break;
      }
      if (y)
        cout << (-1) << "\n";
      else
        PV(v);
    }
  }
  return 0;
}
