#include <bits/stdc++.h>
using namespace std;
const long long N = 10000005;
bool prime_sieve[N] = {0};
void prime() {
  prime_sieve[2] = 1;
  for (long long i = 3; i < N; i += 2) {
    prime_sieve[i] = 1;
  }
  for (long long i = 3; i < N; i += 2) {
    if (prime_sieve[i] == 1) {
      for (long long j = i * i; j < N; j += i) {
        prime_sieve[j] = 0;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  prime();
  long long n, k;
  cin >> n >> k;
  bool first = 0;
  if (n == 1 && k > 0) {
    cout << -1 << endl;
    return 0;
  }
  if (n % 2 == 1) {
    n -= 1;
    first = 1;
  }
  if (k < n / 2) {
    cout << -1 << endl;
    return 0;
  }
  if (k == n / 2) {
    long long c = 0;
    for (long long i = 2; i < N; i++) {
      if (c == n) break;
      if (prime_sieve[i]) {
        cout << i << " ";
        c++;
      }
    }
    if (first == 1) cout << 1;
    cout << endl;
  } else {
    cout << k - (n - 2) / 2 << " " << (k - (n - 2) / 2) * 2 << " ";
    long long c = 0;
    for (long long i = 2; i < N; i++) {
      if (c == (n - 2)) break;
      if (prime_sieve[i] && i != (k - (n - 2) / 2) &&
          i != ((k - (n - 2) / 2) * 2)) {
        cout << i << " ";
        c++;
      }
    }
    if (first == 1) cout << 1;
    cout << endl;
  }
  return 0;
}
