#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
ostream& operator<<(ostream& os, const pair<A, B>& x) {
  return os << "(" << x.first << "," << x.second << ")";
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  vector<int> A(n + 1);
  int cur = 0;
  for (int i = 1; i <= n; ++i) {
    A[i] = i;
    cur += min(i - 1, n - i);
  }
  if (m > cur) {
    printf("-1\n");
    return 0;
  }
  cur -= m;
  int M = 1e9;
  for (int i = n; i >= 1; --i) {
    int add = (i - 1) / 2;
    if (add < cur) {
      cur -= add;
      A[i] = M - (n - i) * (2 * n + 1);
    } else {
      int t = i - 1;
      int nadd = add;
      while (add - nadd < cur) {
        ++A[i];
        --t;
        nadd = t / 2;
      }
      break;
    }
  }
  for (int i = 1; i <= n; ++i) printf("%d ", A[i]);
}
