#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  if (n == 1) {
    if (k == 0)
      cout << 1 << endl;
    else
      cout << -1 << endl;
    return 0;
  }
  if (k < n / 2) {
    cout << -1 << endl;
    return 0;
  }
  set<int> st;
  vector<int> ans(n, -1);
  ans[0] = k - (n / 2 - 1);
  ans[1] = ans[0] * 2;
  st.insert(ans[0]);
  st.insert(ans[1]);
  int c = 1;
  for (int i = 2; i < n; i += 2) {
    while (1) {
      if (st.count(c) == 0 && st.count(c + 1) == 0) {
        ans[i] = c;
        st.insert(c);
        if (i != n - 1) {
          ans[i + 1] = c + 1;
          st.insert(c + 1);
        }
        break;
      } else {
        c++;
      }
    }
  }
  for (long long i = 0; i < (long long)(ans.size()); i++) {
    if (i) cout << " ";
    cout << ans[i];
  }
  cout << endl;
}
