#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  vector<int> ans;
  for (int i = (1); i < (n + 1); ++i) {
    int cur = (i - 1) / 2;
    if (m >= cur) {
      ans.push_back(i);
      m -= cur;
    } else {
      ans.push_back(2 * (i - m) - 1);
      m = 0;
      break;
    }
  }
  if (m != 0) {
    cout << "-1\n";
    return 0;
  }
  int M = 100 * 1000 * 1000;
  int K = 10 * 1000 + 7;
  while ((int)((ans).size()) < n) {
    ans.push_back(M);
    M += K;
  }
  for (int x : ans) cout << x << " ";
  cout << "\n";
  return 0;
}
