#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long powm(long long base, long long exp, long long mod = 1000000007) {
  base %= mod;
  long long ans = 1;
  while (exp) {
    if (exp & 1LL) ans = (ans * base) % mod;
    exp >>= 1LL, base = (base * base) % mod;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  if (n == 1) {
    if (k == 0)
      cout << 1 << '\n';
    else
      cout << -1 << '\n';
    return 0;
  }
  if (n / 2 > k) {
    cout << -1 << '\n';
    return 0;
  }
  long long a = -1;
  if (k > n / 2) {
    a = (k - n / 2 + 1);
    cout << a << " " << a * 2 << " ";
    n -= 2;
  }
  for (int i = 1, curr = 1; i <= n;) {
    if (curr == a || curr == 2 * a) {
      curr = (curr - 1) * 2 + 1;
      continue;
    }
    cout << curr << " ";
    i++;
    curr++;
  }
}
