#include <bits/stdc++.h>
using namespace std;
const long long mx = 2e5 + 7;
void solve(long long n, long long x, long long y) {
  if (y < n) {
    cout << -1 << "\n";
    return;
  }
  long long cnt = n - 1;
  long long tmp = y - (n - 1);
  cnt += tmp * 1LL * tmp;
  if (cnt >= x) {
    for (long long i = 1; i <= n - 1; i++) cout << 1 << "\n";
    cout << tmp << "\n";
  } else {
    cout << -1 << "\n";
    return;
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1, n, x, y;
  while (t--) {
    cin >> n >> x >> y;
    solve(n, x, y);
  }
  return 0;
}
