Preparando MOJI

Sum and product

2000ms 262144K

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.

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.

Sample Input:

2 1

Sample Output:

2 3

Sample Input:

3 5

Sample Output:

1 2 8

Informação

Codeforces

Provedor Codeforces

Código CF530E

Tags

*special

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:57:19

Relacionados

Nada ainda