4240.Petya and Inequiations

Time Limit: 1s Memory Limit: 256MB

Little Petya loves inequations. Help him find n positive integers a1,a2,...,an, such that the following two conditions are satisfied:
a12+a22+...+an2 \ge x a1+a2+...+an \le y

Input Format(From the terminal/stdin)

The first line contains three space-separated integers n, x and y (1 \le n \le 105,1 \le x \le 1012,1 \le y \le 106).

Please do not use the %lld specificator to read or write 64-bit integers in C++. It is recommended to use cin, cout streams or the %I64d specificator.

Output Format(To the terminal/stdout)

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.

Sample Input 1

Copy
5 15 15
 ·  ·  \n

Sample Output 1

Copy
4
4
1
1
2
 \n
 \n
 \n
 \n
 \n

Sample Input 2

Copy
2 3 2
 · · \n

Sample Output 2

Copy
-1
  \n

Sample Input 3

Copy
1 99 11
 ·  ·  \n

Sample Output 3

Copy
11
  \n

Submit

请先 登录

© 2025 FAQs