#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e5 + 113;
const long long MOD = 1e9 + 7;
int n, k;
int ans[N];
int main() {
  cin >> n >> k;
  if (n == 1) {
    cout << ((k == 0) ? 1 : -1);
    return 0;
  }
  if (n / 2 > k) {
    cout << -1;
    return 0;
  }
  ans[n] = 200000000;
  for (int i = 1; i <= 2 * (n / 2); i++) ans[i] = i;
  int d = k - n / 2 + 1;
  int p = (n + d + 1) / d;
  ans[1] = d * p;
  ans[2] = d * (p + 1);
  for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
  return 0;
}
