CF111A Petya and Inequiations
Description
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}
Input Format
The first line contains three space-separated integers $ n $ , $ x $ and $ y $ ( $ 1
Output Format
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.