#include <bits/stdc++.h>
using namespace std;
int ans[100005];
set<int> done;
int main() {
  int n, k;
  cin >> n >> k;
  int g = n / 2;
  if (g == 0 && k != 0)
    cout << -1 << endl;
  else if (g > k)
    cout << -1 << endl;
  else {
    if (k == g)
      for (int i = 0; i < n; i++) ans[i] = i + 1;
    else {
      int x = k - (g - 1);
      ans[0] = x;
      ans[1] = 2 * x;
      done.insert(x);
      done.insert(2 * x);
      x = 1;
      for (int i = 1; i < g; i++) {
        while (done.count(x) || done.count(x + 1)) x++;
        ans[2 * i] = x;
        ans[2 * i + 1] = x + 1;
        done.insert(x);
        done.insert(x + 1);
      }
      if (n & 1) ans[n - 1] = 1000000000;
    }
    for (int i = 0; i < n; i++) printf("%d ", ans[i]);
    printf("\n");
  }
  return 0;
}
