#include <bits/stdc++.h>
const long long INF = (long long)1e7 + 1;
const long long mod = (long long)998244353;
const long long hell = (long long)1000000007;
using namespace std;
long long int power(long long int x, long long int y, long long int md) {
  long long int res = 1;
  while (y > 0) {
    if (y % 2) res = (x % md * res % md) % md;
    x = (x % md * x % md) % md;
    y = y / 2;
  }
  return res;
}
long long int modinv(long long int x) { return power(x, hell - 2, hell); }
void solve();
void fastIO() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  fastIO();
  int test;
  test = 1;
  while (test--) solve();
}
long long int pw(long long int k, long long int x);
long long int gcd(long long int x, long long int y);
void solve() {
  int n, k;
  cin >> n >> k;
  if (k < n / 2) {
    cout << -1;
    return;
  }
  if (n == 1 and k == 0) {
    cout << 1;
    return;
  }
  if (n == 1) {
    cout << -1;
    return;
  }
  int x = n / 2;
  x--;
  k -= x;
  if (k == 0) k = 1;
  cout << k << " " << 2 * k << " ";
  for (int i = 1; i <= n - 2; i++) {
    cout << 2 * k + i << " ";
  }
}
long long int gcd(long long int a, long long int b) {
  while (b != 0) {
    long long int t = b;
    b = a % t;
    a = t;
  }
  return a;
}
long long int pw(long long int k, long long int x) {
  if (x == 0) return 1;
  if (x & 1)
    return ((pw(k, x - 1)) * k);
  else
    return ((pw(k, x / 2)) * (pw(k, x / 2)));
}
