#include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
using namespace std;
const long double PI = 3.14159265358979323846;
const long long MOD = 1e+9 + 7;
const long long INF = LLONG_MAX;
const int INFi = INT_MAX;
const long long N = 2e+5 + 8;
vector<long long> adj[N];
long long vis[N];
long long dx4[] = {0, 1, 0, -1}, dy4[] = {1, 0, -1, 0};
long long test_cases = 1;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
;
long long n, m, a[N][5];
void MAIN(long long tc) {
  long long ok = 0;
  long long en = 0;
  long long row = 1;
  cin >> n >> m;
  for (long long i = (1); i <= m; i++) {
    if (ok == 0) {
      if (en == 0) {
        a[row][1] = i;
      } else {
        a[row][2] = i;
      }
    } else {
      if (en == 0) {
        a[row][4] = i;
      } else {
        a[row][3] = i;
      }
      row++;
    }
    ok ^= 1;
    if (row > n) {
      row = 1;
      en = 1;
    }
  }
  vector<long long> v;
  for (long long i = (1); i <= n; i++) {
    for (auto j : {2, 1, 3, 4}) {
      if (a[i][j] != 0) {
        v.push_back(a[i][j]);
      }
    }
  }
  for (auto it : v) cout << it << " ";
  cout << "\n";
  ;
  ;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  for (long long i = (1); i <= test_cases; i++) {
    MAIN(i);
  }
}
