#include <bits/stdc++.h>
using namespace std;
int lp[10000000 / 2 + 1];
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int main(void) {
  set<int> q;
  int n, k;
  cin >> n >> k;
  if (k < n / 2) {
    cout << -1;
    return 0;
  }
  if (n == 1 && k != 0) {
    cout << -1;
    return 0;
  } else if (n == 1) {
    cout << 1;
    return 0;
  }
  int w = k;
  k -= (n / 2) - 1;
  w -= gcd(k, k * 2);
  cout << k << " " << 2 * k << " ";
  q.insert(k);
  q.insert(2 * k);
  vector<int> pr;
  for (int i = 2; i <= 10000000 / 2; ++i) {
    if (lp[i] == 0) {
      lp[i] = i;
      pr.push_back(i);
    }
    for (int j = 0;
         j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] <= 10000000 / 2; ++j)
      lp[i * pr[j]] = pr[j];
  }
  int m = n - 2;
  for (int i = 0; m > 0 && i < pr.size(); ++i) {
    int a = pr[i];
    if (q.find(a) != q.end() || q.find(a + 1) != q.end()) continue;
    if (m == 1) {
      cout << a << " ";
      q.insert(a);
      --m;
    } else if (gcd(a, a + 1) == 1) {
      w -= gcd(a, a + 1);
      cout << a << " " << a + 1 << " ";
      q.insert(a);
      q.insert(a + 1);
      m -= 2;
    }
  }
}
