CF111A.Petya and Inequiations

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.