**Time limit:**1.00 s**Memory limit:**512 MB

**Input**

The only input line has two integers $n$ and $k$.

**Output**

Print $n$ integers: the removal order.

**Constraints**

- $1 \le n \le 2 \cdot 10^5$

- $0 \le k \le 10^9$

**Example**

Input:

`7 2`

Output:

`3 6 2 7 5 1 4`

**Time limit:**1.00 s**Memory limit:**512 MB

The only input line has two integers $n$ and $k$.

Print $n$ integers: the removal order.

- $1 \le n \le 2 \cdot 10^5$

- $0 \le k \le 10^9$

Input:

`7 2`

Output:

`3 6 2 7 5 1 4`