← 返回题目

题库练习 Petya and Inequiations

← 上一题下一题 →

A8192 | $Petya and Inequiations$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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

输入 #2

2 3 2

输出 #2

-1

输入 #3

1 99 11

输出 #3

C++ 编辑器

输入

输出