#include <bits/stdc++.h>
using namespace std;
int maxn = 1000000000;
set<int> s;
int main() {
  int n, k;
  cin >> n >> k;
  int t1 = 1;
  int t2 = 2;
  if (n % 2 == 0) {
    if (k < n / 2)
      cout << -1 << endl;
    else if (k == n / 2) {
      for (int i = 0; i < n; i++) {
        if (i) cout << ' ';
        cout << i + 1;
      }
      cout << endl;
    } else {
      for (int i = 1; i <= (n - 2) / 2; i++) {
        if (2 * i != k - (n - 2) / 2 && 2 * i + 1 != k - (n - 2) / 2 &&
            2 * i != 2 * (k - (n - 2) / 2) &&
            2 * i + 1 != 2 * (k - (n - 2) / 2))
          cout << 2 * i << ' ' << 2 * i + 1 << ' ';
        else {
          cout << maxn - (t1++) << ' ' << maxn - (t2++) << ' ';
          t1++;
          t2++;
        }
      }
      cout << k - (n - 2) / 2 << ' ' << 2 * (k - (n - 2) / 2) << endl;
    }
  } else {
    if (n == 1) {
      if (k == 0) {
        cout << 814 << endl;
        return 0;
      } else {
        cout << -1 << endl;
        return 0;
      }
    }
    n--;
    if (k < n / 2)
      cout << -1 << endl;
    else if (k == n / 2) {
      for (int i = 0; i < n; i++) {
        if (i) cout << ' ';
        cout << i + 1;
      }
      cout << ' ' << maxn << endl;
    } else {
      for (int i = 1; i <= (n - 2) / 2; i++) {
        if (2 * i != k - (n - 2) / 2 && 2 * i + 1 != k - (n - 2) / 2 &&
            2 * i != 2 * (k - (n - 2) / 2) &&
            2 * i + 1 != 2 * (k - (n - 2) / 2))
          cout << 2 * i << ' ' << 2 * i + 1 << ' ';
        else {
          cout << maxn - (t1++) << ' ' << maxn - (t2++) << ' ';
          t1++;
          t2++;
        }
      }
      cout << k - (n - 2) / 2 << ' ' << 2 * (k - (n - 2) / 2) << ' '
           << maxn - (t1 + 3) << endl;
    }
  }
}
