#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
int ans[maxn], a[maxn];
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = 3; i <= n; i++) a[i] = a[i - 1] + (i - 1) / 2;
  if (m > a[n])
    printf("-1\n");
  else {
    int j = 3;
    ans[1] = 1;
    ans[2] = 2;
    while (m) {
      if (m >= a[j] - a[j - 1]) {
        ans[j] = j;
        m -= a[j] - a[j - 1];
      } else {
        ans[j] = ans[j - 1] + ans[j - m * 2];
        m = 0;
      }
      j++;
    }
    for (int i = j; i <= n; i++) ans[i] = ans[i - 1] + ans[j - 1] + 1;
    for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  }
  return 0;
}
