#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int a[N];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  int tot = 0;
  for (int i = 1; i <= n; i++) {
    if (m < (i - 1) / 2) break;
    a[++tot] = i;
    m -= (i - 1) / 2;
  }
  if (!m) {
    int cnt = 1e8;
    for (int i = tot + 1; i <= n; i++) a[i] = cnt, cnt += 10000;
    for (int i = 1; i <= n; i++) cout << a[i] << ' ';
  } else {
    if (tot == n)
      puts("-1");
    else {
      a[tot + 1] = a[tot] + a[tot] - m * 2 + 1;
      int cnt = 1e8;
      for (int i = tot + 2; i <= n; i++) a[i] = cnt, cnt += 10000;
      for (int i = 1; i <= n; i++) cout << a[i] << ' ';
    }
  }
}
