#include <bits/stdc++.h>
using namespace std;
using lld = long long int;
using pii = pair<int, int>;
using pll = pair<lld, lld>;
using pil = pair<int, lld>;
using pli = pair<lld, int>;
using piii = pair<pii, int>;
int n, m;
int a[5009];
int main() {
  int i, j, k, l;
  int t = 1, tv = 0;
  while (t--) {
    scanf("%d %d", &n, &m);
    int limit = (n / 2) * ((n - 1) / 2);
    if (m > limit) {
      printf("-1\n");
      break;
    }
    a[0] = 1;
    a[1] = 2;
    for (i = 2; i < n; i++) {
      j = i / 2;
      if (j > m) j = m;
      if (j == 0) {
        a[i] = 100000000 + i * 10001;
      } else {
        if (j == i / 2)
          a[i] = i + 1;
        else {
          a[i] = a[i - 1] + a[i - 2 * j];
        }
        m -= j;
      }
    }
    for (i = 0; i < n; i++) {
      printf("%d ", a[i]);
    }
    printf("\n");
  }
}
