#include <bits/stdc++.h>
int n, d, l;
int dp[110][20012];
int main() {
  scanf("%d%d%d", &n, &d, &l);
  memset(dp, -1, sizeof(dp));
  dp[n + 1][10000] = 0;
  for (int i = n + 1; i > 1; i--) {
    for (int j = 0; j <= 20000; j++)
      if (dp[i][j] >= 0) {
        for (int k = 1; k <= l; k++) {
          int tmp = k - (j - 10000) + 10000;
          if (tmp >= 0 && tmp <= 20000) dp[i - 1][tmp] = k;
        }
      }
  }
  if (dp[1][d + 10000] <= 0)
    printf("-1\n");
  else {
    for (int i = 1; i < n; i++) {
      int k = dp[i][d + 10000];
      printf("%d ", k);
      d = k - d;
    }
    printf("%d\n", dp[n][d + 10000]);
  }
  return 0;
}
