Problem Statement

It has been handed down that a sequence $v = (a_1,a_2,a_3)$ consisting of 3 elements is a Kadomatsu sequence when $v$ satisfies the following conditions.

1. $a_1,a_2,a_3$ are all distinct
2. Among the 3 elements, $a_2$ is the largest or the smallest

Furthermore, a sequence $w = (a_1,...,a_n)$ consisting of $n$ elements (where $3\le n$) is called
a Kadomatsu sequence sequence when any 3 consecutive elements taken from $w$ form a Kadomatsu sequence.

For example, the sequence $(2,0,1,7,0,1)$ is not a Kadomatsu sequence sequence, because the Kadomatsu sequence condition fails exactly when taking the 3 consecutive elements starting from the 2nd element from the left.

Since that is a pity, let us consider a definition under which this sequence can also be called a Kadomatsu sequence sequence.
We call a sequence of $n$ elements in which "exactly $n-k-2$ of the groups of $3$ consecutive elements form a Kadomatsu sequence" a $一般門松列列_{n,k}$ (general Kadomatsu sequence sequence).

That is, $(2,0,1,7,0,1)$ is a $一般門松列列_{6,1}$.

Natural numbers $n$ and $k$ are given.
Output one sequence that satisfies $一般門松列列_{n,k}$. If no such sequence exists, output -1.

Input

n k

$3 \le n \le 20171$
$0 \le k \le n-2$

Output

Output one sequence satisfying $一般門松列列_{n,k}$, separated by spaces or by newlines.
The elements of the output sequence must be integers within the range from $0$ to $10^9$, inclusive.

Print a newline at the end.

A special judge written in C++14 is used.
In cases where multiple solutions exist, any of them will be accepted.

Sample

6 1

2 0 1 7 0 1

5 3

1 2 4 8 16

8 0

1 3 2 4 1 3 2 4