#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, d, l, maxn, minn;
  scanf("%d%d%d", &n, &d, &l);
  if (n % 2) {
    maxn = n / 2 * (l - 1) + l;
    minn = n / 2 * (1 - l) + 1;
  } else {
    maxn = n / 2 * (l - 1);
    minn = n / 2 * (1 - l);
  }
  if (d < minn || d > maxn)
    printf("-1\n");
  else {
    int a[200];
    for (int i = 0; i < n; i++)
      if (i % 2)
        a[i] = 1;
      else
        a[i] = l;
    int sum = maxn;
    for (int i = 0; i < n; i += 2) {
      if (sum > d) {
        if (i == n - 1) {
          a[i] -= sum - d;
          break;
        }
        a[i] = 1;
        a[i + 1] = l;
        sum -= 2 * (l - 1);
      }
      if (sum < d) {
        int dis = d - sum;
        a[i] += (dis / 2);
        a[i + 1] -= (dis - dis / 2);
        break;
      }
    }
    printf("%d", a[0]);
    for (int i = 1; i < n; i++) printf(" %d", a[i]);
    printf("\n");
  }
  return 0;
}
