Unusual Sequence

A sequence $A$ of length $n$ is unusual when both of the following conditions hold.

• Every integer from $1$ to $n$ appears exactly once, so $A$ is a permutation of $1$ through $n$.
• Exactly $k$ of the indices $i$ with $1 \le i \le n$ satisfy $\gcd(i, A_i) > 1$.

Given $n$ and $k$, find an unusual sequence.

The first line contains $n$ and $k$, separated by a space. ($1 \le n \le 10^5$, $0 \le k \le n$)

If no unusual sequence exists, print Impossible on the first line.

If one exists, several sequences may satisfy the conditions, so only the sequence fixed by the rule below counts as correct. Let $m = n - k$ and define $A$ this way.

• $A_i = i + 1$ for $1 \le i \le m - 1$
• $A_m = 1$
• $A_i = i$ for $m + 1 \le i \le n$

The first $m$ positions hold $2, 3, \dots, m, 1$ in that order, and every later position holds $A_i = i$. Print this sequence $A$ on the first line, separated by spaces.