#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  std::cerr << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  std::cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
template <typename T, typename U>
static inline void amin(T& x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T& x, U y) {
  if (x < y) x = y;
}
long long max(long long a, long long b) { return (a > b) ? a : b; }
long long min(long long a, long long b) { return (a < b) ? a : b; }
vector<long long> ans;
long long last = 1;
long long solve() {
  long long n, m;
  cin >> n >> m;
  vector<long long> z;
  if (n) {
    z.push_back(1);
    n--;
  }
  if (n) {
    z.push_back(2);
    n--;
  }
  last = 3;
  long long i = 2;
  while (m > 0 && n > 0) {
    i++;
    long long add = (i - 1) / 2;
    if (m < add) {
      break;
    }
    last = i + 1;
    m -= add;
    n--;
    z.push_back(i);
  }
  if (m && n > 0) {
    for (long long i = 0; i < z.size() - 1; i++) {
      long long add = (z.size() - i);
      add /= 2;
      if (add <= m) {
        m -= add;
        n--;
        z.push_back(z[i] + z[z.size() - 1]);
        last = z[z.size() - 1] + 1;
      }
      if (m == 0 || n == 0) break;
    }
  }
  long long ins = 1e9;
  vector<long long> zz;
  for (long long i = 0; i < n; i++) {
    zz.push_back(ins);
    ins -= last;
  }
  if (n < 0 || m) return cout << -1, 0;
  reverse(zz.begin(), zz.end());
  for (auto i : zz) z.push_back(i);
  for (auto i : z) cout << i << " ";
  cout << '\n';
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
