#include <bits/stdc++.h>
using namespace std;
long long int n, k;
int main() {
  cin >> n >> k;
  if (n == 1 && k == 0) {
    cout << "1" << endl;
    return 0;
  }
  long long int total = n / 2;
  if (total > k || total == 0) {
    cout << "-1" << endl;
    return 0;
  }
  long long int last = k + 1 - total;
  set<long long int> v;
  v.insert(last);
  v.insert(2 * last);
  int cur = 1;
  for (int i = 0; i < total - 1; i++) {
    if (v.find(cur) == v.end() && v.find(cur + 1) == v.end()) {
      cout << cur << " " << cur + 1 << " ";
      v.insert(cur);
      v.insert(cur + 1);
      cur += 2;
    } else {
      cur += 1;
      i = i - 1;
    }
  }
  if (n % 2 != 0) {
    cout << last << " " << 2 * last << " ";
    while (v.find(cur + 1) != v.end()) cur++;
    cout << cur + 1 << endl;
  } else
    cout << last << " " << 2 * last << endl;
  return 0;
}
