Seating On Bus

 

Consider 2n 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 4n.

Consider that m (m ≤ 4n) 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 > 2n) 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.

Input

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

Output

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

Example

Input

2 7

Output

5 1 6 2 7 3 4

Input

9 36

Output

19 1 20 2 21 3 22 4 23 5 24 6 25 7 26 8 27 9 28 10 29 11 30 12 31 13 32 14 33 15 34 16 35 17 36 18

 

若是人数小于等于靠窗户的位子数，则直接按序输出，否则按规律将数字存入数组中，注意数组大小为4n，不能开小，序号小于人数时，单数位置从2n+1开始向后取，双数从1开始取，知道单数位置大于人数，则按序输出

 

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int a[405];
int main()
{
	int n, m, j;
	while(cin>>n>>m){
		if(m <= 2 * n){
			for(int i = 1; i < m; i++)
				cout<<i<<" ";
				cout<<m<<endl;
		}
		else{
			j = 0;
			memset(a, -1, sizeof(a));
			for(int i = 2 * n + 1; i <= m; i++){
				a[j] = i;
				j += 2;
			}
			j = 1;
			for(int i = 1; i <= 2 * n; i++){
				if(a[j] == -1){
					a[j] = i;
					j++;
				}
				else{
					j++;
					a[j++] = i;
				}
			}
			for(int i = 0; i < j - 1; i++){
				cout<<a[i]<<" ";
			}
			cout<<a[j - 1]<<endl;
		}
	}
	return 0;
}