#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, d, l;
  cin >> n >> d >> l;
  int up = (((n + 1) / 2) * l) - ((n / 2) * 1);
  int lo = ((n + 1) / 2) * 1 - ((n / 2) * l);
  if (d < lo || d > up) {
    cout << "-1\n";
    return 0;
  } else {
    int ar[n];
    if ((abs(up - d)) < (abs(d - lo))) {
      for (int i = 0; i < n; i += 2) {
        ar[i] = l;
      }
      for (int i = 1; i < n; i += 2) {
        ar[i] = 1;
      }
      int dif = abs(up - d);
      int cur = 0;
      while (cur < n) {
        while (ar[cur] > 1 && dif > 0) {
          ar[cur]--;
          dif--;
        }
        if (dif == 0) {
          for (int i = 0; i < n; ++i) cout << ar[i] << " ";
          cout << endl;
          return 0;
        }
        cur += 2;
      }
    } else {
      for (int i = 0; i < n; i += 2) {
        ar[i] = 1;
      }
      for (int i = 1; i < n; i += 2) {
        ar[i] = l;
      }
      int dif = abs(d - lo);
      int cur = 0;
      while (cur < n) {
        while (ar[cur] < l && dif > 0) {
          ar[cur]++;
          dif--;
        }
        if (dif == 0) {
          for (int i = 0; i < n; ++i) cout << ar[i] << " ";
          cout << endl;
          return 0;
        }
        cur += 2;
      }
    }
  }
}
