#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  T r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
int getbit(T s, int i) {
  return (s >> i) & 1;
}
template <class T>
T onbit(T s, int i) {
  return s | (T(1) << i);
}
template <class T>
T offbit(T s, int i) {
  return s & (~(T(1) << i));
}
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
const int infi = 2e9;
const long long Linfi = (long long)1e18;
int n, k;
int a[100005];
void thuchien() {
  if (n == 1 && k == 0) {
    cout << 1 << endl;
    return;
  } else if (n == 1 || n / 2 > k) {
    cout << -1 << endl;
    return;
  }
  int tmp = k - n / 2;
  tmp++;
  a[1] = tmp;
  a[2] = 2 * tmp;
  int st = 2 * tmp + 1;
  int ok = 0;
  st = 3e8 + 1;
  for (int i = 3; i <= n; i++) {
    if (ok == 0) {
      a[i] = st;
      ok ^= 1;
    } else if (ok == 1) {
      a[i] = 2 * st - 1;
      st++;
      ok ^= 1;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", a[i]);
}
int main() {
  cin >> n >> k;
  thuchien();
  return 0;
}
