#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e6 + 100;
const int mod = (int)1e9 + 7;
int n, m, mx, ans[5050];
int main() {
  scanf("%d%d", &n, &m);
  mx = (n - 1) * (n - 1) / 4;
  if (m == 0) {
    for (auto i = (1); i <= (n); ++i)
      printf("%d ", n * (i * 13 + 29) + 1000000);
    return 0;
  }
  if (n < 3 || m > mx) return puts("-1"), 0;
  for (auto i = (1); i <= (n); ++i) ans[i] = i;
  int pos = 0;
  for (auto i = (1); i <= (n); ++i)
    if ((i - 1) * (i - 1) / 4 >= m) {
      pos = i;
      break;
    }
  for (auto i = (pos + 1); i <= (n); ++i) ans[i] = n * (i * 13 + 29) + 1000000;
  m -= (pos - 2) * (pos - 2) / 4;
  ans[pos] = 2 * pos - 2 * m - 1;
  for (auto i = (1); i <= (n); ++i) printf("%d ", ans[i]);
}
