#include <bits/stdc++.h>
using namespace std;
const auto INF = 0x3f3f3f3f;
const int N = 1e5 + 5;
long long ans[N];
int main() {
  int n;
  long long x, y;
  scanf("%d%lld%lld", &n, &x, &y);
  if (y < n) {
    printf("-1\n");
    return 0;
  }
  long long temp = n - 1;
  for (int i = 1; i < n; i++) {
    ans[i] = 1;
  }
  ans[n] = y - n + 1;
  temp += ans[n] * ans[n];
  if (temp < x) {
    printf("-1\n");
    return 0;
  }
  for (int i = 1; i <= n; i++) printf("%lld\n", ans[i]);
}
