#include <bits/stdc++.h>
using namespace std;
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
bool comps(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.second == b.second) return a.first < b.first;
  return a.second < b.second;
}
void fastio() {
  ios::sync_with_stdio(0);
  cin.tie(0);
}
void inout() {}
int main() {
  fastio();
  long long int n, d, x, c, r;
  cin >> n >> x >> d;
  long long int a[n];
  memset(a, 0, sizeof(a));
  if (x <= (d - 1) * (n / 2) + (d) * (n % 2) &&
      x >= (1 - d) * (n / 2) + (n % 2)) {
    if (x >= 0) {
      if (x == 0 && n % 2 == 1) {
        a[1]++;
      }
      if (n % 2) x--;
      long long int i = 0;
      while (x > 0) {
        if (i > n - 1) i = 0;
        a[i]++;
        x--;
        i += 2;
      }
      for (int j = 0; j < n; j++) {
        cout << a[j] + 1 << " ";
      }
    } else {
      x = (-1) * x;
      if (n % 2) x++;
      long long int i = 1;
      while (x > 0) {
        if (i > n - 1) i = 1;
        a[i]++;
        x--;
        i += 2;
      }
      for (int j = 0; j < n; j++) {
        cout << a[j] + 1 << " ";
      }
    }
  } else
    cout << -1;
  return 0;
}
