302732: CF530E. Sum and product

You are given integers N and D. Find N positive integers x₁...x_N 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 10⁶.

2 1

2 3

3 5

1 2 8