#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
long long power(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret *= a;
    a *= a;
    if (ret >= MOD) ret %= MOD;
    if (a >= MOD) a %= MOD;
    b >>= 1;
  }
  return ret;
}
long long inv(long long x) { return power(x, MOD - 2); }
const int N = 1e5 + 5, M = 5e7 + 5;
int n, k, A[N];
bool vis[M];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> k;
  if (n == 1) {
    if (k == 0)
      cout << "1";
    else
      cout << "-1";
    return 0;
  }
  if (k == 0) {
    cout << "-1";
    return 0;
  }
  bool add = n & 1;
  int pairs = n / 2;
  if (pairs > k) {
    cout << "-1";
    return 0;
  }
  if (pairs == k) {
    for (int i = 1; i <= n; i++) cout << i << " ";
    return 0;
  }
  --pairs;
  int num = k - pairs;
  cout << num << " " << 2 * num << " ";
  int cnt = 2;
  for (int i = 1; i <= M and cnt < n - add; i += 2) {
    if (i == num or i + 1 == num or i == 2 * num or i + 1 == 2 * num) continue;
    cout << i << " " << i + 1 << " ";
    cnt += 2;
  }
  if (add) cout << 1000000000;
}
