#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<long long> sh;
void solve() {
  long long i, j, k, l, r, m, n, a, b, c, d, x, y, z, t;
  cin >> n >> m;
  long long flag = 0;
  for (i = 1; i <= n; i++) {
    if (!flag && sh.size() / 2 <= m) {
      m -= sh.size() / 2;
      sh.push_back(i);
    } else if (!flag) {
      sh.push_back(sh[sh.size() - 2 * m - 1] + sh.back());
      m = 0;
      flag = 1;
      x = sh.back() * 2 + 1;
      d = sh.back() * 2;
    } else if (flag == 1) {
      sh.push_back(x);
      flag = 2;
    } else
      sh.push_back(sh.back() + d);
  }
  if (m) {
    cout << -1 << endl;
    return;
  }
  for (auto &cv : sh) cout << cv << ' ';
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
