#include <bits/stdc++.h>
const long long INF = 2009000999;
const long double cp = 2 * asin(1.0);
const long double eps = 1e-9;
const long long mod = 1000000007LL;
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> a;
  if (n != 1 && k == 0) {
    cout << "-1";
    return 0;
  }
  if (n == 1 && k != 0) {
    cout << "-1";
    return 0;
  }
  if (k == 0) {
    for (int(i) = (1); (i) <= (n); i++) cout << i << ' ';
    return 0;
  }
  if (n / 2 > k)
    cout << "-1";
  else {
    long long h = n / 2, l = k - h + 1, g = 2;
    cout << l << ' ' << 2 * l << ' ';
    int i = 1;
    while (a.size() < n - 2) {
      if (i != l && i + 1 != l && i != 2 * l && i + 1 != 2 * l) {
        a.push_back(i);
        a.push_back(i + 1);
        i += 2;
      } else if (2 * l - l > 1)
        i++;
      else
        i = 2 * l + 1;
    }
    for (int(i) = 0; (i) < (a.size()); i++) {
      g++;
      if (g > n) break;
      cout << a[i] << ' ';
    }
  }
  return 0;
}
