#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, d, l;
int memo[105][20005];
bool f(int i, int last) {
  if (i == n - 1) return last >= 1 && last <= l;
  int &ret = memo[i][last + 10001];
  if (ret != -1) return ret;
  for (int j = 1; j <= l; j++) {
    int next = j - last;
    if (f(i + 1, next)) return ret = 1;
  }
  return ret = false;
}
void print(int i, int last) {
  if (i == n - 1) {
    cout << last << " ";
    return;
  }
  for (int j = 1; j <= l; j++) {
    int next = j - last;
    if (f(i + 1, next)) {
      cout << j << " ";
      print(i + 1, next);
      return;
    }
  }
}
int main() {
  cin >> n >> d >> l;
  memset(memo, -1, sizeof(memo));
  if (f(0, d)) {
    print(0, d);
  } else {
    puts("-1");
  }
}
