#include <bits/stdc++.h>
using namespace std;
const int N = 1e4 + 7;
const int M = 1e9;
int n, m, vt, tmp = 0;
int cnt[N];
vector<int> ans;
int main() {
  ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  cin >> n >> m;
  for (vt = 1; vt <= n; vt++) {
    if (m < cnt[vt]) break;
    m -= cnt[vt];
    ans.push_back(vt);
    tmp = max(tmp, vt);
    for (int j = (1); j < (vt); j++) cnt[j + vt]++;
  }
  if (vt > n && m) return cout << -1, 0;
  if (m) {
    while (m != cnt[vt]) vt++;
    ans.push_back(vt);
    tmp = max(tmp, vt);
  }
  while ((int)ans.size() < n)
    ans.push_back(M - (tmp + 1) * (n - (int)ans.size()));
  for (auto i : ans) cout << i << " ";
  return 0;
}
