#include <bits/stdc++.h>
using namespace std;
const double pi = 3.141592653689793238460;
const long long inf = 0x3f3f3f3f3f3f;
const int N = 2e5 + 5;
const int pr = 31;
using ld = long double;
int mod = 1e9 + 7;
long long gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(int a, int b) { return (a / gcd(a, b)) * b; }
int fact(int n) {
  int res = 1;
  for (int i = 2; i <= n; i++) res = res * i % mod;
  return res % mod;
}
int ncr(int n, int r) { return fact(n) / (fact(r) * fact(n - r)); }
int power(long long x, unsigned int y, int p) {
  int res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long nCr(long long n, long long k) {
  long long C[105][1005];
  long long i, j;
  for (i = 0; i <= n; i++) {
    for (j = 0; j <= min(i, k); j++) {
      if (j == 0 || j == i)
        C[i][j] = 1;
      else
        C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]);
    }
  }
  return C[n][k];
}
unsigned int setbit(long long n) {
  unsigned long long count = 0;
  while (n) {
    n &= (n - 1);
    count++;
  }
  return count;
}
int sub(string s1, string s2) {
  int M = s1.length();
  int N = s2.length();
  for (int i = 0; i <= N - M; i++) {
    int j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
long long dp[10005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << fixed << setprecision(17);
  int n, d, l;
  cin >> n >> d >> l;
  int o = (n / 2);
  int e = n - o;
  int minm = e - o * l;
  int maxm = e * l - o;
  if (d < minm || d > maxm) {
    cout << -1 << endl;
    return 0;
  }
  int es, os;
  for (int i = o; i <= o * l; i++) {
    int x = (d + i);
    if (x >= (e) && x <= (e * l)) {
      es = x;
      os = i;
      break;
    }
  }
  int ans[10005];
  int ea = (es) / e;
  int oa = (os) / o;
  for (int i = 0; i < (int)n; i++) {
    if (i % 2 == 0) {
      ans[i] = ea;
      es -= ea;
    } else {
      ans[i] = oa;
      os -= oa;
    }
  }
  for (int i = 0; i < (int)n; i++) {
    if (i % 2 == 0 && es > 0) {
      ans[i] += 1;
      es--;
    } else if (i % 2 == 1 && os > 0) {
      ans[i] += 1;
      os--;
    }
  }
  for (int i = 0; i < (int)n; i++) {
    cout << ans[i] << " ";
  }
}
