#include <bits/stdc++.h>
using namespace std;
const int inf = 1e18;
const int mod = 1e9 + 7;
inline int bigmod(int B, int P) {
  int R = 1;
  while (P > 0) {
    if (P & 1) {
      R = (R * B) % mod;
    }
    P >>= 1;
    B = (B * B) % mod;
  }
  return R;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, m, a, b, t;
  cin >> n >> m;
  if (m <= 2 * n) {
    for (int i = 1; i <= m; i++) cout << i << " ";
    return 0;
  } else {
    t = m - 2 * n;
    a = 2 * n + 1;
    b = 1;
    for (int i = 0; i < t / 2; i++) {
      cout << a++ << " " << b++ << " " << a++ << " " << b++ << " ";
    }
    if (t % 2) cout << a << " ";
    for (int i = b; i <= 2 * n; i++) cout << i << " ";
  }
  return 0;
}
