#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, i, j, k, sum = 0, ans = 0, count = 0, c1 = 0, c2 = 0, x = -1;
  cin >> n >> k;
  long long a[5001] = {0}, b[5001] = {0};
  a[0] = 0;
  a[1] = 0;
  a[2] = 0;
  sum = 1;
  for (i = 3; i < 5001; i++) {
    a[i] = sum;
    a[i] += a[i - 1];
    if (i % 2 == 0) sum++;
  }
  if (a[n] < k) {
    cout << -1;
    return 0;
  }
  if (k == 0) {
    cout << 1 << " ";
    if (n == 2)
      cout << 2 << " ";
    else if (n > 2) {
      cout << 2 << " ";
      b[0] = 1;
      b[1] = 2;
      for (i = 2; i < n; i++) {
        cout << b[1] + (i - 1) * 3 << " ";
      }
    }
    return 0;
  }
  j = lower_bound(a, a + n + 1, k) - a;
  if (a[j] == k) {
    for (i = 1; i <= j; i++) {
      cout << i << " ";
      b[i] = i;
    }
    for (i = j + 1; i <= n; i++) {
      cout << b[j] + ((i - j) * (b[j] + 1)) << " ";
    }
  } else {
    j--;
    for (i = 1; i <= j; i++) {
      cout << i << " ";
      b[i] = i;
    }
    k = k - a[j];
    if (j % 2 == 0) {
      sum = j / 2;
      for (i = 1; i <= j - 1; i++) {
        if (k == sum) break;
        if (i % 2 == 1) sum--;
      }
      cout << j + i << " ";
      b[j + 1] = j + i;
      for (i = j + 2; i <= n; i++) {
        cout << b[j + 1] + ((i - (j + 1)) * (b[j] + 1)) << " ";
      }
    } else {
      sum = j / 2;
      for (i = 1; i <= j - 1; i++) {
        if (k == sum) break;
        if (i % 2 == 0) sum--;
      }
      cout << j + i << " ";
      b[j + 1] = j + i;
      for (i = j + 2; i <= n; i++) {
        cout << b[j + 1] + ((i - (j + 1)) * (b[j] + 1)) << " ";
      }
    }
  }
  return 0;
}
