#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const long long INF = 1e9;
inline long long pwr(long long base, long long n, long long m) {
  long long ans = 1;
  while (n > 0) {
    if (n % 2 == 1) ans = (ans * base) % m;
    base = (base * base) % m;
    n /= 2;
  }
  return ans;
}
int n, k;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  if (n == 1 && k != 0) {
    cout << -1;
    return 0;
  }
  if (n / 2 > k) {
    cout << -1;
    return 0;
  }
  int z = 1e9;
  for (int i = 0; i < n - n % 2 - 2; i++) {
    cout << z << " " << z - 1 << " ";
    z -= 2;
    i++;
    k--;
  }
  if (n >= 2) cout << k << " " << k * 2 << " ";
  if (n % 2 != 0) cout << (k * 2) + 1;
  return 0;
}
