#include <bits/stdc++.h>
using namespace std;
int main() {
  int long long n, k;
  cin >> n >> k;
  int long long pairs = floor(n / 2);
  if (k == 0 && n == 1) {
    cout << "1\n";
    return 0;
  }
  if (k < pairs || n == 1) {
    cout << "-1\n";
    return 0;
  }
  cout << setprecision(10);
  for (int long long i = 1; i < pairs; i++) {
    cout << 2 * i - 1 << " " << 2 * i << " ";
  }
  int long long req_gcd = k - pairs + 1;
  int long long no1 = pow(10, 8);
  while (no1 % req_gcd != 0) {
    no1++;
  }
  cout << no1 << " " << no1 + req_gcd;
  if (n % 2) {
    cout << " " << pow(10, 9) - 1;
  }
  return 0;
}
