#include <bits/stdc++.h>
using namespace std;
int n, m;
int main(void) {
  cin >> n >> m;
  long long k = 0;
  int i = 0;
  vector<int> v;
  for (i = 0; i < n; i++) {
    if (k + i / 2 > m) break;
    k += i / 2;
    v.push_back(i + 1);
  }
  if (v.size() == n && k < m) {
    cout << -1 << endl;
    return 0;
  }
  if (v.size() < n) {
    v.push_back(2 * i + 1 - 2 * (m - k));
    i++;
    int maxi = v[v.size() - 1];
    for (int j = n - i; j >= 1; j--)
      v.push_back(1000000000 - (maxi + 1) * (j - 1));
  }
  for (auto e : v) {
    printf("%d ", e);
  }
  return 0;
}
