#include <bits/stdc++.h>
using namespace std;
int n, d, l;
int cur[105];
int rec(int pos, int dif) {
  int i;
  if (pos == 1) {
    if (dif < 1 || dif > l)
      return 0;
    else {
      cur[pos] = dif;
      return 1;
    }
  }
  int L = (pos + 1) / 2, R = pos - L;
  if (L - l * R > dif || L * l - R < dif) return 0;
  for (i = 1; i <= l; i++) {
    if (rec(pos - 1, i - dif)) {
      cur[pos] = i;
      return 1;
    }
  }
  return 0;
}
int main() {
  int i;
  while (cin >> n >> d >> l) {
    if (!rec(n, d))
      cout << "-1" << endl;
    else {
      for (i = n; i > 0; i--) {
        if (i != n) cout << " ";
        cout << cur[i];
      }
      cout << endl;
    }
  }
  return 0;
}
