Petya and Inequiations

题意翻译

对于给出的整数 $n, x, y,$ 找出一个正整数数组 $a$ ,满足: $\begin{cases}a_1^2+a_2^2+...+a_n^2\geq x\\a_1+a_2+...+a_n\leq y\end{cases}$ **【输入格式】** 一行,三个整数 $n, x, y,$ 以空格分隔。 **【输出格式】** $n$ 行,每行一个整数,其中第 $i$ 行表示 $a_i$。如果有多组解,只需输出任意一种。 特别地,如果原方程组无解,只输出一个 $-1$。 **【数据范围】** 对于 $100 \%$ 的数据: $1\leq n\leq 10^5$ $1\leq x\leq 10^{12}$ $1\leq y\leq 10^6$

题目描述

Little Petya loves inequations. Help him find $ n $ positive integers $ a_{1},a_{2},...,a_{n} $ , such that the following two conditions are satisfied: - $ a_{1}^{2}+a_{2}^{2}+...+a_{n}^{2}>=x $ - $ a_{1}+a_{2}+...+a_{n}<=y $

输入输出格式

输入格式


The first line contains three space-separated integers $ n $ , $ x $ and $ y $ ( $ 1<=n<=10^{5},1<=x<=10^{12},1<=y<=10^{6} $ ). Please do not use the %lld specificator to read or write 64-bit integers in С++. It is recommended to use cin, cout streams or the %I64d specificator.

输出格式


Print $ n $ positive integers that satisfy the conditions, one integer per line. If such numbers do not exist, print a single number "-1". If there are several solutions, print any of them.

输入输出样例

输入样例 #1

5 15 15

输出样例 #1

4
4
1
1
2

输入样例 #2

2 3 2

输出样例 #2

-1

输入样例 #3

1 99 11

输出样例 #3

11