#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 50;
const int inf = 0x3f3f3f3f;
const int M = 5000 * 4;
int a[5050];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int cnt = 0;
  int flag = 0;
  int k = 0;
  for (int i = 1; i <= n; i++) {
    if (flag == 1) {
      a[i] = 5e8 + k;
      k += 5050;
      continue;
    }
    if (cnt + (i - 1) / 2 <= m) {
      a[i] = i;
      cnt += (i - 1) / 2;
    } else {
      int p = m - cnt;
      cnt += p;
      a[i] = i - 1 + i - 2 * p;
      flag = 1;
    }
  }
  if (cnt != m)
    printf("-1\n");
  else {
    for (int i = 1; i <= n; i++) printf("%d%c", a[i], i == n ? '\n' : ' ');
  }
  return 0;
}
