#include <bits/stdc++.h>
using namespace std;
long long n, x, y;
int ans[100010];
bool f() {
  ans[0] = y - (n - 1);
  for (int i = 1; i < n; ++i) {
    ans[i] = 1;
  }
  if (ans[0] < 1) return false;
  long long ss = 0;
  for (int i = 0; i < n; ++i) {
    ss += (long long)ans[i] * ans[i];
  }
  return ss >= x;
}
int main() {
  cin >> n >> x >> y;
  if (f()) {
    for (int i = 0; i < n; ++i) {
      printf("%d\n", ans[i]);
    }
  } else {
    printf("-1\n");
  }
}
