#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
int main() {
  long long 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;
  else {
    long long p, x = k - ((n - 2) / 2);
    cout << x << " " << 2 * x << " ";
    p = 2 * x + 1;
    for (long long i = 1; i <= (n - 2) / 2; i++, p += 2)
      cout << p << " " << p + 1 << " ";
    if (n & 1) cout << p << endl;
  }
  return 0;
}
