#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17 + 5;
const long long MAXN = 1e6 + 5;
const int MOD = 1e9 + 7;
int main() {
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    int a[110] = {0}, b[110] = {0}, c[110] = {0}, d[110] = {0};
    int k = 0;
    int j = 1;
    int flag = 0;
    while (flag < n) {
      a[k++] = j;
      j = j + 2;
      flag++;
    }
    flag = 0;
    k = 0;
    while (flag < n) {
      b[k++] = j;
      j = j + 2;
      flag++;
    }
    int v = 2;
    flag = 0;
    k = 0;
    while (flag < n) {
      d[k++] = v;
      v = v + 2;
      flag++;
    }
    flag = 0;
    k = 0;
    while (flag < n) {
      c[k++] = v;
      v = v + 2;
      flag++;
    }
    for (int i = 0; i < n; i++) {
      if (b[i] <= m) printf("%d ", b[i]);
      if (a[i] <= m) printf("%d ", a[i]);
      if (c[i] <= m) printf("%d ", c[i]);
      if (d[i] <= m) printf("%d ", d[i]);
    }
    printf("\n");
  }
  return 0;
}
