#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  if (n <= 2 && m == 0) {
    for (int i = 0; i < n; i++) cout << i + 1 << " ";
    exit(0);
  }
  long long indx = (n - 1) / 2;
  indx--;
  long long maxsum = indx * (indx + 1) / 2;
  maxsum *= 2;
  indx++;
  if (n % 2 == 0) maxsum += indx;
  maxsum += indx;
  if (m > maxsum) {
    cout << -1;
    exit(0);
  }
  cout << 1 << " " << 2 << " ";
  long long sum = 0;
  int i;
  for (i = 3;; i++) {
    sum += (i - 1) / 2;
    if (m < sum) break;
    cout << i << " ";
    if (i == n) exit(0);
  }
  sum -= (i - 1) / 2;
  i--;
  int last = i + 1;
  if (sum != m) {
    int rem = m - sum;
    last = (2 * i) + 1 - (2 * rem);
    cout << last << " ";
    i++;
  }
  if (i == n) exit(0);
  vector<int> right;
  i++;
  for (int p = 1000000000; i <= n; p -= last + 1, i++) right.push_back(p);
  while (!right.empty()) {
    cout << right.back() << " ";
    right.pop_back();
  }
}
