#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
  #include "settings/debug.cpp"
  #define _GLIBCXX_DEBUG
#else
  #define Debug(...) void(0)
#endif
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)

void solve() {
  ll n, x;
  cin >> n >> x;
  if (n * (n + 1) / 2 > x) {
    cout << -1 << endl;
    return;
  }
  //x <= n*(2l+n-1)/2
  // 2x/n <= 2l+n-1
  // 2l >= 2x/n - n + 1
  // l <= x/n - (n-1)/2
  ll l_ok = x / n, l_ng = -1;
  while (l_ok - l_ng > 1) {
    assert(l_ok > l_ng);
    ll l = (l_ok + l_ng) / 2;
    if (x <= n * (2 * l + n - 1) / 2) {
      l_ok = l;
    } else {
      l_ng = l;
    }
  }
  Debug(l_ok);
  vector<ll> ans(n);
  rep(i, n) ans[i] = l_ok + n - i - 1;
  rep(i, n) x -= ans[i];
  assert(x <= 0);
  assert(x > -n);
  for (int i = n - 1; i >= 0; --i) {
    if (x == 0) break;
    --ans[i], ++x;
  }
  assert(x == 0);
  rep(i, n) cout << ans[i] << " ";
  cout << endl;
}

int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}