#include <bits/stdc++.h>
using namespace std;
int n, m, lo = -2, dif;
int res[5005];
int main() {
  cin >> n >> m;
  for (int i = (n + 1) - 1; i >= 0; i--)
    if (i * (ceil(i / 2.0) - 1) - ceil(i / 2.0) * (ceil(i / 2.0) - 1) >= m)
      lo = i - 1;
  for (int i = 0; i < (lo); i -= -1) res[i] = i + 1;
  for (int i = (lo + 1); i < (n); i -= -1)
    res[i] = 1000000000 - (n - i - 1) * 49000;
  dif = (lo + 1) * (ceil((lo + 1) / 2.0) - 1) -
        ceil((lo + 1) / 2.0) * (ceil((lo + 1) / 2.0) - 1) - m;
  res[lo] = lo + 2 * dif + 1;
  if (lo == -2)
    cout << -1;
  else
    for (int i = 0; i < (n); i -= -1) cout << res[i] << " ";
}
