#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> ans;
void solve() {
  cin >> n >> m;
  while (m) {
    if (ans.size() > n) break;
    if (ans.size() == 0) {
      ans.push_back(1);
      ans.push_back(2);
      ans.push_back(3);
      --m;
      continue;
    }
    int temp = ans.size();
    if (m >= temp / 2) {
      ans.push_back(temp + 1);
      m -= temp / 2;
    } else {
      ans.push_back(temp - m * 2 + 1 + temp);
      m = 0;
    }
  }
  if (ans.size() > n) {
    cout << -1 << endl;
    return;
  }
  int t = 1e8;
  while (ans.size() < n) {
    t += 1e4;
    ans.push_back(t);
  }
  for (int i = 0; i < n; ++i) cout << ans[i] << " ";
  cout << endl;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
