#include <bits/stdc++.h>
using namespace std;
const int MX = 1e8, DD = 1e4;
int f(int n, int x) {
  assert(x > n);
  if (x >= 2 * n) return 0;
  int mx = (x - 1) / 2;
  int mn = x - n;
  return mx - mn + 1;
}
int ff(vector<int> v) {
  vector<int> x = v;
  sort(x.begin(), x.end());
  if (x[0] <= 0 || x.back() > 1e9 || v != x) return -1;
  set<int> st(v.begin(), v.end());
  if (st.size() != v.size()) return -1;
  int ans = 0;
  for (int i = 0; i < v.size(); i++) {
    for (int j = i + 1; j < v.size(); j++) {
      if (st.count(v[i] + v[j])) ans++;
    }
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  int am = m;
  vector<int> ans;
  for (int i = 1; i <= n; i++) {
    if (m == 0) {
      ans.push_back(MX + i * DD);
      continue;
    }
    if (m >= f(i - 1, i)) {
      ans.push_back(i);
      m -= f(i - 1, i);
      continue;
    }
    int j = i;
    while (f(i - 1, j) > m) j++;
    ans.push_back(j);
    m -= f(i - 1, j);
    assert(m == 0);
  }
  if (m) {
    cout << -1 << endl;
    return 0;
  }
  for (int x : ans) cout << x << " ";
  cout << endl;
}
