#include <bits/stdc++.h>
const double E = 2.7182818284590452353602874713527;
using namespace std;
long ara[1000000];
int main() {
  long num, n, k, i, res, p, q, ind;
  scanf("%ld%ld", &n, &k);
  if (n == 1 && k != 0) {
    printf("-1\n");
    return 0;
  }
  if (n == 1 && k == 0) {
    printf("1\n");
    return 0;
  }
  if (k == 0 && n > 1) {
    printf("-1\n");
    return 0;
  }
  num = n;
  if (((n) % 2 == 1)) n--;
  if (k < n / 2)
    printf("-1\n");
  else {
    p = n - 2;
    for (i = 0; i < p; i++) {
      ara[i] = i + 1;
    }
    q = p / 2;
    res = k - q;
    if (res) {
      ara[p] = res;
      ara[p + 1] = res * 2;
      if (res <= p) {
        ara[res - 1] = 104395117;
      }
      if (res * 2 <= p) {
        ind = res * 2;
        ara[ind - 1] = 104395169;
      }
      p += 2;
    }
    if (((num) % 2 == 1)) {
      ara[p] = 300000000;
      p++;
    }
    for (i = 0; i < p; i++) {
      if (i) printf(" ");
      printf("%ld", ara[i]);
    }
    printf("\n");
  }
  return 0;
}
