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 ≤ 105, 1 ≤ x ≤ 1012, 1 ≤ y ≤ 106).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<br />2 3 2<br />1 99 11<br />
输出
4<br />4<br />1<br />1<br />2<br />-1<br />11<br />
加载中...