#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, x, y;
  cin >> n >> x >> y;
  if (n > y) {
    cout << -1 << endl;
    return 0;
  }
  long long *ans = new long long[n + 1];
  for (int i = 0; i < n - 1; i++) {
    ans[i] = 1;
  }
  ans[n - 1] = y - (n - 1);
  long long xx = 0;
  for (int i = 0; i < n; i++) {
    xx += ans[i] * ans[i];
  }
  if (xx >= x) {
    for (int i = 0; i < n; i++) cout << ans[i] << endl;
  } else
    cout << -1 << endl;
  delete[] ans;
  return 0;
}
