#include <bits/stdc++.h>
using namespace std;
void solve_pos(vector<int>& vec, int l, int d) {
  int ans = 0;
  int n = vec.size();
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      vec[i] = l;
      ans += l;
    } else {
      vec[i] = 1;
      ans -= 1;
    }
  }
  ans = ans - d;
  for (int i = 1; i < n; i += 2) {
    if (ans == 0) break;
    vec[i] = min(l, ans + 1);
    ans -= (vec[i] - 1);
  }
  for (int i = 0; i < n; i += 2) {
    if (ans <= 0) break;
    vec[i] -= min(l - 1, ans);
    ans -= (min(l - 1, ans));
  }
}
void solve_neg(vector<int>& vec, int l, int d) {
  int n = vec.size();
  for (int i = 0; i < vec.size(); i++) {
    if (i % 2 == 1) {
      vec[i] = l;
      d += l;
    } else {
      vec[i] = 1;
      d -= 1;
    }
  }
  for (int i = 0; i < n; i += 2) {
    if (d == 0) break;
    vec[i] = min(l, d + 1);
    d -= (vec[i] - 1);
  }
}
int main() {
  int n, d, l;
  cin >> n >> d >> l;
  vector<int> vec(n);
  int half = n / 2;
  int max_pos = half * l - half;
  int max_neg = -1 * max_pos;
  if (n % 2 == 1) {
    max_pos += l;
    max_neg++;
  }
  int init = d;
  vector<int> vec2 = vec;
  if (d >= max_neg && d <= max_pos) {
    if (d >= 0)
      solve_pos(vec, l, d);
    else
      solve_neg(vec, l, d);
    for (int x : vec) cout << x << ' ';
    cout << '\n';
  } else
    cout << "-1\n";
  return 0;
}
