Uolevi owns a forest that has n trees numbered 1,2,\dots,n. The i-th tree weighs i kilos. He also has an unlimited number of lumber trucks, each of which can conveniently fit n kilos of wood. Uolevi is planning to thin the forest by cutting k trees. Help Uolevi select those trees in such a way that they can be transported with some number of trucks, minimizing the total empty space in them. The trees can be cut to smaller pieces to fill the trucks more tightly. If there are multiple answers, print any.

Input

The only line of input contains the size of the forest n and the number of trees to cut k.

Output

Output t_1\ t_2\ \dots\ t_k, the trees that Uolevi should cut, in one line.

Constraints

• 1 \leq k \leq n \leq 10^5

Example 1

Input:

6 1

Output:

6

Example 2

Input:

10 6

Output:

1 2 3 5 9 10

Example 3

Input:

4 4

Output:

1 2 3 4