#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, d, l;
  cin >> n >> d >> l;
  vector<int> v;
  int last = d;
  for (int i = 0; i < n; i++) {
    int t = 1 + max(last, 0);
    t = min(t, l);
    if (i == n - 1) t = last;
    v.push_back(t);
    last = t - last;
  }
  if (v[n - 1] < 1 or v[n - 1] > l) {
    cout << -1 << endl;
    return false;
  }
  for (int i = 0; i < n - 1; i++) cout << v[i] << ' ';
  cout << v[n - 1] << endl;
  return 0;
}
