#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353.;
const int N = 1e6 + 5;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second > b.second);
}
long long powermod(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
bool isprime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, m;
  cin >> n >> m;
  vector<long long> a(n + 1);
  long long curr = 0;
  long long temp = 0;
  a[1] = 1;
  a[2] = 2;
  long long mx = 200000;
  for (long long i = 3; i <= n; i++) {
    curr = (i - 1) / 2;
    if (curr + temp <= m) {
      a[i] = i;
      temp += curr;
    } else if (curr + temp > m && temp < m) {
      long long t = m - temp;
      a[i] = a[i - 1] + a[i - 2 * t];
      temp = m;
    } else if (temp == m) {
      a[i] = mx;
      mx += 100005;
    }
  }
  if (temp == m) {
    for (long long i = 1; i <= n; i++) {
      cout << a[i] << " ";
    }
  } else
    cout << -1 << "\n";
  return 0;
}
