#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 7;
const int M = (int)1e9 + 7;
long long n, x, y;
void solve() {
  cin >> n >> x >> y;
  if (y < n) {
    cout << -1;
    return;
  }
  long long k = y - (n - 1);
  long long sum = n - 1 + k;
  long long mul = n - 1 + k * k;
  if (mul < x) {
    cout << -1;
    return;
  }
  while (n > 1) {
    cout << 1 << "\n";
    n--;
  }
  cout << k << "\n";
}
int main() {
  ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int tt = 1, i = 0;
  while (tt--) {
    solve();
  }
  return 0;
}
