#include <bits/stdc++.h>
const int maxn = 100;
using namespace std;
int n, m;
int a[maxn + 10], b[maxn + 10], c[maxn + 10], d[maxn + 10];
int main() {
  scanf("%d%d", &n, &m);
  int e = 1, f = 1, g = 1, h = 1;
  if (m <= 2 * n) {
    for (int i = 1; i <= m; i++) printf("%d ", i);
  } else {
    for (int i = 1; i <= n * 2 - 1; i += 2) {
      a[e++] = i;
      b[f++] = i + 1;
    }
    for (int i = n * 2 + 1; i <= m; i += 2) {
      c[g++] = i;
    }
    for (int i = n * 2 + 2; i <= m; i += 2) {
      d[h++] = i;
    }
    int e = 1, f = 1, g = 1, h = 1;
    for (int i = 1; i <= m; i++) {
      if (c[g]) printf("%d ", c[g++]);
      if (a[e]) printf("%d ", a[e++]);
      if (d[h]) {
        printf("%d ", d[h++]);
      }
      if (b[f]) printf("%d ", b[f++]);
    }
  }
  return 0;
}
