CF660B.Seating On Bus

Consider 2_n_ rows of the seats in a bus. n rows of the seats on the left and n rows of the seats on the right. Each row can be filled by two people. So the total capacity of the bus is 4_n_.

Consider that m (m ≤ 4_n_) people occupy the seats in the bus. The passengers entering the bus are numbered from 1 to m (in the order of their entering the bus). The pattern of the seat occupation is as below:

1-st row left window seat, 1-st row right window seat, 2-nd row left window seat, 2-nd row right window seat, ... , n-th row left window seat, n-th row right window seat.

After occupying all the window seats (for m > 2_n_) the non-window seats are occupied:

1-st row left non-window seat, 1-st row right non-window seat, ... , n-th row left non-window seat, n-th row right non-window seat.

All the passengers go to a single final destination. In the final destination, the passengers get off in the given order.

1-st row left non-window seat, 1-st row left window seat, 1-st row right non-window seat, 1-st row right window seat, ... , n-th row left non-window seat, n-th row left window seat, n-th row right non-window seat, n-th row right window seat.

The seating for n = 9 and m = 36.

You are given the values n and m. Output m numbers from 1 to m, the order in which the passengers will get off the bus.

考虑一辆公交车中有 $2n$ 行座位：左侧 $n$ 行，右侧 $n$ 行。每行可坐两人，因此公交车的总容量为 $4n$。

现有 $m$（$m \leq 4n$）名乘客登上该公交车。上车乘客按上车顺序编号为 $1$ 到 $m$。座位占用模式如下：

第 $1$ 行左窗座、第 $1$ 行右窗座、第 $2$ 行左窗座、第 $2$ 行右窗座、……、第 $n$ 行左窗座、第 $n$ 行右窗座。

当所有窗座均被占满后（即 $m > 2n$ 时），再依次占用非窗座：

第 $1$ 行左非窗座、第 $1$ 行右非窗座、……、第 $n$ 行左非窗座、第 $n$ 行右非窗座。

所有乘客均前往同一终点站。在终点站，乘客按如下顺序下车：

第 $1$ 行左非窗座、第 $1$ 行左窗座、第 $1$ 行右非窗座、第 $1$ 行右窗座、……、第 $n$ 行左非窗座、第 $n$ 行左窗座、第 $n$ 行右非窗座、第 $n$ 行右窗座。

当 $n = 9$ 且 $m = 36$ 时的座位安排示意图。

给定 $n$ 和 $m$ 的值，请输出 $1$ 到 $m$ 这 $m$ 个数字的一个排列，表示乘客下车的顺序。

The only line contains two integers, n and m (1 ≤ n ≤ 100, 1 ≤ m ≤ 4_n_) — the number of pairs of rows and the number of passengers.

唯一一行包含两个整数 $n$ 和 $m$（$1leq n leq 100$，$1 leq m leq 4n$）—— 分别表示行对的数量和乘客数量。

Print m distinct integers from 1 to m — the order in which the passengers will get off the bus.

输出 m 个互不相同的整数，取值范围为 1 到 m —— 表示乘客下车的顺序。