#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
void solve() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 1; i <= n; i++) {
    if (2 * n + 2 * i - 1 <= m) {
      cout << 2 * n + 2 * i - 1 << " ";
    }
    if (2 * i - 1 <= m) cout << 2 * i - 1 << " ";
    if (2 * n + 2 * i <= m) cout << 2 * n + 2 * i << " ";
    if (2 * i <= m) cout << 2 * i << " ";
  }
  cout << endl;
}
int32_t main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
