#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 5;
long long n, x, y, ans;
long long a[N];
int main() {
  cin >> n >> x >> y;
  if (n > y) {
    cout << "-1";
    return 0;
  }
  a[0] = max(1ll, y - n + 1);
  ans += a[0] * a[0];
  for (int i = 1; i < n; i++) a[i] = 1, ans++;
  if (ans < x)
    cout << "-1";
  else
    for (int i = 0; i < n; i++) cout << a[i] << endl;
  return 0;
}
