#include <bits/stdc++.h>
using namespace std;
int n, k, a[100100], g[50100];
int add = 1, sum;
int main() {
  scanf("%d%d", &n, &k);
  if (n == 1 && k) return cout << -1, 0;
  if (n & 1) a[n - 1] = 99999989;
  for (int i = 0; i < n / 2; i++) {
    while (add * (n / 2 - i) <= k - sum) add++;
    if (add * (n / 2 - i) > k - sum) add--;
    sum += add;
    g[i] = add;
    if (!add) {
      return cout << -1, 0;
    }
  }
  int last = 0, h = 1;
  for (int i = 0; i < n / 2; i++) {
    while (h * g[i] <= last) h++;
    a[2 * i] = h * g[i];
    a[2 * i + 1] = ++h * g[i];
    last = a[2 * i + 1];
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", a[i]);
  }
}
