Problem Statement

A sequence of length $A + B$, $E = (E_1, E_2, \dots, E_{A+B})$, that satisfies all of the conditions below is said to be a god sequence.

• $E_1 + E_2 + \cdots + E_{A+B} = 0$ holds.
• There are exactly $A$ positive integers among $E_1, E_2, \dots, E_{A+B}$.
• There are exactly $B$ negative integers among $E_1, E_2, \dots, E_{A+B}$.
• $E_1, E_2, \dots, E_{A+B}$ are all distinct.
• $-10^{9} \leq E_i \leq 10^9, E_i \neq 0$ holds for every $i$ $(1 \leq i \leq A+B)$.

Construct one god sequence.

We can prove that at least one god sequence exists under Constraints of this problem.

Constraints

• $1 \leq A \leq 1000$
• $1 \leq B \leq 1000$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the elements of your sequence in one line, with space as separator.

If there are multiple god sequences, any of them will be accepted.

E_1 E_2 \cdots E_{A+B}