#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int maxm = 1e3 + 5;
const int mod = 1e9 + 7;
vector<int> a;
inline void solve() {
  int n, k;
  scanf("%d%d", &n, &k);
  if ((n == 1 && k > 0) || n / 2 > k) {
    puts("-1");
    return;
  }
  if (n == 1 && k == 0) {
    puts("1");
    return;
  }
  int res = k - (n - 2) / 2;
  a.push_back(res);
  a.push_back(res * 2);
  int last = res * 2 + 1;
  if (last < 1) last = 1;
  for (int i = 0; i < n - 2; i++) a.push_back(last++);
  for (int i = 0; i < n; i++) {
    if (i == 0)
      printf("%d", a[i]);
    else
      printf(" %d", a[i]);
  }
  puts("");
}
int main() {
  solve();
  return 0;
}
