#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
template <class T>
T gcd(T a, T b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return (a * b) / gcd(a, b);
}
int main() {
  int n, k;
  cin >> n >> k;
  if (n / 2 > k) {
    cout << -1 << endl;
    return 0;
  }
  if (n == 1) {
    if (k > 0) {
      cout << -1 << endl;
    } else
      cout << 1 << endl;
    return 0;
  }
  int l = k - n / 2 + 1;
  cout << l << " " << 2 * l << " ";
  int j = 1;
  for (int i = 0; i < (n / 2 - 1); i++) {
    while ((j == l || j == 2 * l) || (j + 1 == l || j + 1 == 2 * l)) j++;
    cout << j << " " << j + 1 << " ";
    j += 2;
  }
  if (n & 1) {
    while (j == l || j == 2 * l) j++;
    cout << j;
    j += 2;
  }
  cout << endl;
  return 0;
}
