#include <bits/stdc++.h>
const int N = 1E6 + 10;
const int MOD = 1e9 + 7;
const long long oo = 1e9;
using namespace std;
long long n, x, y;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> x >> y;
  if (n > y) {
    cout << -1;
    return 0;
  }
  long long t = (long long)sqrt(x) - n + 1ll;
  long long k = y - n + 1;
  bool ok;
  if (k >= 1e8)
    ok = true;
  else {
    k = k * k + n - 1;
    if (k >= x)
      ok = true;
    else
      ok = false;
  }
  if (ok) {
    for (int i = 0; i < n - 1; i++) cout << 1 << endl;
    cout << y - n + 1;
    return 0;
  } else
    cout << -1;
  return 0;
}
