#include <bits/stdc++.h>
using namespace std;
void Solved() {
  long long n, k;
  cin >> n >> k;
  vector<long long> ans;
  long long half = n / 2;
  if (half > k) {
    cout << "-1" << endl;
    return;
  }
  if (n == 1 && k >= 1) {
    cout << "-1" << endl;
    return;
  }
  if (n == 1 && k == 0) {
    cout << n << endl;
    return;
  }
  map<long long, int> mp;
  long long d = (k - ((n - 2) / 2));
  ans.push_back(d);
  mp[d]++;
  ans.push_back(d * 2);
  mp[d * 2]++;
  for (int i = 1; i <= 1000000000; i++) {
    if (ans.size() == n) {
      break;
    }
    if (mp[i] == 0) {
      ans.push_back(i);
      mp[i]++;
    }
  }
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
}
int main() {
  Solved();
  return 0;
}
