#include <iostream>
#include <map>
#include <set>
#include <vector>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;

    vector<int> rw, rnw, lnw, lw;
    int cnt = 1;
    while(cnt <= 2 * n) {
        lw.push_back(cnt);
        if(cnt + 1 > n * 2) {
            break;
        }
        rw.push_back(cnt + 1);
        cnt += 2;
    }
    while(cnt <= 4 * n) {
        lnw.push_back(cnt);
        if(cnt + 1 > 4 * n) {
            break;
        }
        rnw.push_back(cnt + 1);
        cnt += 2;
    }
    for(int i = 0; i < n; i++) {
        if(lnw[i] <= m and lnw.size() >= i + 1) {
            cout << lnw[i] << " ";
        }
        if(lw[i] <= m and lw.size() >= i + 1) {
            cout << lw[i] << " ";
        }
        if(rnw[i] <= m and rnw.size() >= i + 1) {
            cout << rnw[i] << " ";
        }
        if(rw[i] <= m and rw.size() >= i + 1) {
            cout << rw[i] << " ";
        }
    }
    return 0;
}