#P530E. Sum and product
-
ID: 3230
Type: RemoteJudge
2000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
Hydro
Tags> Sum and product
No submission language available for this problem.
Description
You are given integers N and D. Find N positive integers x1...xN such that the difference of their product and their sum equals D.
The only line of input contains integers N (2 ≤ N ≤ 1000) and D (0 ≤ D ≤ 1000).
Output N integers that satisfy the given condition in non-decreasing order (in a single line, separated with spaces). Note that some numbers can be equal. Numbers printed by you must not exceed 106.
Input
The only line of input contains integers N (2 ≤ N ≤ 1000) and D (0 ≤ D ≤ 1000).
Output
Output N integers that satisfy the given condition in non-decreasing order (in a single line, separated with spaces). Note that some numbers can be equal. Numbers printed by you must not exceed 106.
Samples
2 1
2 3
3 5
1 2 8