#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long g, h, l;
const long long N = 100005;
long long add(long long a, long long b);
long long mul(long long a, long long b);
long long binpo(long long a, long long b);
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m;
  cin >> n >> m;
  long long tot = 0;
  for (long long i = 1; i <= n; i++) {
    tot += (i - 1) / 2;
  }
  if (tot < m) {
    cout << -1;
    return 0;
  }
  long long idx = 1;
  tot = 0;
  if (n == 1) {
    cout << 1;
    return 0;
  }
  while (tot + (idx - 1) / 2 <= m) {
    tot += (idx - 1) / 2;
    idx++;
  }
  for (long long i = 1; i <= idx - 1; i++) {
    cout << i << " ";
  }
  long long rem = m - tot;
  long long nums = 2 * rem;
  long long start = idx - 1 - nums + 1;
  if (nums) {
    cout << start + idx - 1 << " ";
    rem--;
    idx++;
  }
  for (long long i = idx; i <= n; i++) {
    cout << fixed << (100000000ll + 1ll + 5000ll * i) << " ";
  }
  return 0;
}
long long add(long long a, long long b) { return (a % MOD + b % MOD) % MOD; }
long long mul(long long a, long long b) { return (a * 1ll * b) % MOD; }
long long binpo(long long a, long long b) {
  int ans = 1;
  while (b) {
    if (b % 2 != 0) {
      ans = mul(ans, a);
    }
    a = mul(a, a);
    b = b / 2;
  }
  return ans;
}
