For a permutation

of

, let

be the number of

satisfying

and

.
Given two integers

and

, your task is to find a permutation

of

such that

is maximized.
Recall that in a permutation of

, each integer from

to

(both inclusive) appears exactly once.
输入描述:
There is only one test case in each test file.
The first and only line contains two integers

and

(

).
输出描述:
Output one line containing

integers indicating a permutation

of

that maximizes

. If there are multiple valid answers you can output any of them.
Please, DO NOT output extra spaces at the end of the line, or your answer may be considered incorrect!