#include <bits/stdc++.h>
using namespace std;
inline long long getint() {
  long long _x = 0, _tmp = 1;
  char _tc = getchar();
  while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
  if (_tc == '-') _tc = getchar(), _tmp = -1;
  while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();
  return _x * _tmp;
}
long long mypow(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 1ll;
  long long _tmp = mypow(_a, _x / 2, _mod);
  _tmp = (_tmp * _tmp) % _mod;
  if (_x & 1) _tmp = (_tmp * _a) % _mod;
  return _tmp;
}
inline long long add(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x + _y;
  if (_ >= _mod) _ -= _mod;
  return _;
}
inline long long sub(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x - _y;
  if (_ < 0) _ += _mod;
  return _;
}
inline long long mul(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x * _y;
  if (_ >= _mod) _ %= _mod;
  return _;
}
inline bool equal(double _x, double _y) {
  return _x > _y - 1e-9 && _x < _y + 1e-9;
}
int __ = 1, _cs;
void build() {}
int a[1111][4];
int n, m;
int r, s;
int x[4] = {2, 0, 3, 1};
void init() {
  n = getint();
  m = getint();
  r = 1, s = 0;
  for (int i = 1; i <= m; i++) {
    a[r][s] = i;
    if (s == 0)
      s = 1;
    else if (s == 1) {
      r++;
      s = 0;
      if (r > n) {
        r = 1;
        s = 2;
      }
    } else if (s == 2)
      s = 3;
    else {
      r++;
      s = 2;
    }
  }
}
void solve() {
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < 4; j++)
      if (a[i][x[j]]) printf("%d ", a[i][x[j]]);
  puts("");
}
int main() {
  build();
  while (__--) {
    init();
    solve();
  }
}
