#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, i;
  map<int, int> vis;
  scanf("%d %d", &n, &k);
  if (n == 1 && k == 0) {
    cout << 1;
    return 0;
  }
  if (n == 1) {
    cout << -1;
    return 0;
  }
  if (k < n / 2) {
    cout << -1;
    return 0;
  }
  int temp = k - (n - 2) / 2;
  cout << temp << " " << 2 * temp << " ";
  vis[temp] = 1, vis[2 * temp] = 1;
  int dis = 1;
  for (i = 0; i < (n / 2) - 1; i++) {
    while (vis[dis] || vis[dis + 1]) dis++;
    cout << dis << " " << dis + 1 << " ";
    vis[dis] = 1;
    vis[dis + 1] = 1;
  }
  if (n & 1) {
    while (vis[dis] == 1) dis++;
    cout << dis;
  }
  return 0;
}
