#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long mod = 998244353;
const int phash = 3;
const long long modhash = 1000000000000000003;
int sum[5005];
int main() {
  ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (i - 1) / 2;
  if (sum[n] < m) {
    cout << -1;
    return 0;
  }
  if (sum[n] == m) {
    for (int i = 1; i <= n; i++) cout << i << " ";
    return 0;
  }
  int k = 0;
  for (int i = 1; i <= n; i++)
    if (sum[i] < m) k = i;
  vector<int> ans(n + 1);
  for (int i = 1; i <= k; i++) ans[i] = i;
  ans[k + 1] = 2 * k + 1;
  ans[k + 1] -= 2 * (m - sum[k]);
  for (int i = k + 2; i <= n; i++) ans[i] = (1e8 + 1e4 * i);
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
}
