#include <bits/stdc++.h>
using namespace std;
void qmax(int &x, int y) {
  if (x < y) x = y;
}
void qmin(int &x, int y) {
  if (x > y) x = y;
}
inline int read() {
  char s;
  int k = 0, base = 1;
  while ((s = getchar()) != '-' && s != EOF && !(isdigit(s)))
    ;
  if (s == EOF) exit(0);
  if (s == '-') base = -1, s = getchar();
  while (isdigit(s)) {
    k = k * 10 + (s ^ '0');
    s = getchar();
  }
  return k * base;
}
inline void write(int x) {
  static char cnt, num[15];
  cnt = 0;
  if (!x) {
    printf("0");
    return;
  }
  for (; x; x /= 10) num[++cnt] = x % 10;
  for (; cnt; putchar(num[cnt--] + 48))
    ;
}
const long long mod = 1e9 + 7;
const int maxn = 2010;
int n, k, s;
long long dp[maxn][maxn], ans;
int main() {
  n = read();
  k = read();
  if (n == 1 && k != 0) {
    printf("-1");
    return 0;
  }
  if (n == 1 && k == 0) {
    printf("1");
    return 0;
  }
  s = k - n / 2 + 1;
  if (s <= 0) {
    printf("-1");
    return 0;
  }
  printf("%d %d ", s * 2, s);
  n -= 2;
  int d = 1, x = n % 2;
  n /= 2;
  for (int i = 1; i <= n; i++) {
    while (d == s || d == 2 * s || (d + 1) == s || (d + 1) == 2 * s) d++;
    printf("%d %d ", d, d + 1);
    d += 2;
  }
  if (x == 1) {
    while (d == s || d == 2 * s || (d + 1) == s || (d + 1) == 2 * s) d++;
    printf("%d\n", d);
    return 0;
  }
  return 0;
}
