#include <bits/stdc++.h>
using namespace std;
const int ma = 3000000;
bool kk[ma];
int pn[ma], n[ma], totp, tot;
set<int> ps, ns;
int total;
void ini() {
  int i, p;
  totp = tot = 0;
  memset(kk, 1, sizeof(kk));
  for (i = 2; i * i <= ma - 5; i++) {
    if (kk[i]) {
      p = i * i;
      while (p <= ma - 5) {
        kk[p] = 0;
        p += i;
      }
    }
  }
  for (i = 2; i <= ma - 5 && totp <= 100006; i++) {
    if (kk[i]) {
      pn[++totp] = i;
    }
  }
  for (int i = 1; i <= totp; i++) ps.insert(pn[i]);
}
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  if (k < n / 2) {
    printf("-1\n");
    return 0;
  }
  if (n == 1) {
    if (k == 0)
      puts("7");
    else
      printf("-1\n");
    return 0;
  }
  printf("%d %d", k - n / 2 + 1, 2 * (k - n / 2 + 1));
  ini();
  set<int>::iterator pa;
  pa = ps.find(k - n / 2 + 1);
  if (pa != ps.end()) ps.erase(pa);
  pa = ps.find(2 * (k - n / 2 + 1));
  if (pa != ps.end()) ps.erase(pa);
  pa = ps.begin();
  for (int i = 3; i <= n; i++) {
    printf(" %d", *pa);
    pa++;
  }
  puts("");
  return 0;
}
