#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
const int maxn = 1e4 + 5;
int a[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = (1); i < (n + 1); i++) a[i] = i;
  int s = 0;
  for (int i = (1); i < (n + 1); i++) s += (i - 1) / 2;
  m = s - m;
  if (m < 0)
    cout << -1;
  else {
    int N = 1e9;
    for (int i = n; i > 0; i--)
      if (m) {
        int c = (i - 1) / 2;
        if (c <= m) {
          m -= c;
          a[i] = N - 10001 * (n - i);
        } else {
          int t = i - 1;
          while (m) {
            a[i]++;
            m -= (t / 2) - (t - 1) / 2;
            t--;
          }
          break;
        }
      }
    for (int i = (1); i < (n + 1); i++) {
      if (i > 1) cout << " ";
      cout << a[i];
    }
  }
  return 0;
}
