#include <bits/stdc++.h>
using namespace std;
long n, d, k, l, m, i, j, a[105], b[2];
int main() {
  cin >> n >> d >> l;
  b[0] = n / 2;
  b[1] = n - b[0];
  k = 0;
  if (d > l * b[1] - b[0] || d < b[1] - l * b[0]) {
    cout << "-1" << endl;
    return 0;
  } else {
    for (i = 1; i <= n; i += 2) {
      a[i] = 1;
      k++;
    }
    for (i = 2; i <= n; i += 2) {
      a[i] = l;
      k -= l;
    }
  }
  i = 1;
  while (d != k && i <= n) {
    if (k + l - 1 <= d) {
      a[i] = l;
      k = k - 1 + l;
    } else {
      a[i] += d - k;
      k = d;
    }
    i += 2;
  }
  i = 2;
  while (d != k && i <= n) {
    if (k + l - 1 <= d) {
      a[i] = 1;
      k = k - 1 + l;
    } else {
      a[i] -= d - k;
      k = d;
    }
    i += 2;
  }
  cout << a[1];
  for (i = 2; i <= n; i++) cout << " " << a[i];
  cout << endl;
}
