#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5 + 2;
const long long MOD = 1e9 + 7;
const long long Inf = MOD * MOD;
const long double eps = 1e-7;
long long n, k, a[N], timer, t = 1;
void Solve() {
  scanf("%lld%lld", &n, &k);
  if (n == 1) {
    if (k == 0) {
      puts("1");
    } else {
      puts("-1");
    }
    return;
  }
  if (n / 2 > k) {
    puts("-1");
    return;
  }
  k = k - n / 2 + 1;
  printf("%lld %lld ", k, 2 * k);
  k = 2 * k + 1;
  for (int i = 3; i <= n; ++i) {
    printf("%lld ", k++);
  }
}
int main() {
  while (t--) {
    ++timer;
    Solve();
    puts("");
  }
}
