#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  return b == 0 ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
T my_pow(T n, T p) {
  if (p == 0) return 1;
  T x = my_pow(n, p / 2);
  x = (x * x);
  if (p & 1) x = (x * n);
  return x;
}
template <class T>
T big_mod(T n, T p, T m) {
  if (p == 0) return (T)1;
  T x = big_mod(n, p / 2, m);
  x = (x * x) % m;
  if (p & 1) x = (x * n) % m;
  return x;
}
template <class T>
inline T Mod(T n, T m) {
  return (n % m + m) % m;
}
template <class T>
T extract(string s, T ret) {
  stringstream ss(s);
  ss >> ret;
  return ret;
}
template <class T>
string itos(T n) {
  ostringstream ost;
  ost << n;
  ost.flush();
  return ost.str();
}
long long stoi(string s) {
  long long r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
double toDouble(string s) {
  double r = 0;
  istringstream sin(s);
  sin >> r;
  return r;
}
long long ar[2000005], ar1[200005];
long long a = 0, b = 0, c = 0, r = 0, rr = 0, res = 0, n, m;
string ss;
int main() {
  cin >> n >> m;
  long long aa = n / 2;
  long long bb = n / 2;
  if (aa > m) {
    cout << -1;
    return 0;
  }
  if (n == 1) {
    if (m == 0)
      cout << 1;
    else
      cout << -1;
    return 0;
  }
  long long cc = m - ((bb - 1) >= 0 ? bb - 1 : 0);
  long long pos = -1;
  for (int i = 1000000000 - cc; i >= 1; i--) {
    if (i % cc == 0) {
      cout << i << " " << i + cc << " ";
      int kk = i + cc;
      n -= 2;
      pos = i - 1;
      break;
    }
  }
  for (int i = pos; i >= 1 and n; i--) {
    cout << i << " ";
    n--;
  }
  return 0;
}
