#include <bits/stdc++.h>
using namespace std;
int a[100005];
map<int, bool> m;
int main() {
  int n, k, u = 0;
  cin >> n >> k;
  if (k < n / 2 || (n == 1 && k != 0))
    cout << -1;
  else if (k == 0 && n == 1)
    cout << 1;
  else {
    u = k - (n - 2) / 2;
    a[0] = u;
    a[1] = u * 2;
    m[u] = true;
    m[u * 2] = true;
    int j = 1;
    for (int i = 2; i < n; i++) {
      while (m[j] == true) j++;
      a[i] = j;
      j++;
    }
    for (int i = 0; i < n; i++) cout << a[i] << " ";
  }
  return 0;
}
