#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    ll x;
    cin >> n >> x;
    if (ll(n) * (n + 1) / 2 > x) {
      cout << -1 << '\n';
      continue;
    }
    VL ans(n);
    auto check = [](int n, ll x, ll ub) {
      ll mn = ll(n) * (n + 1) / 2;
      ll mx;
      if (__builtin_mul_overflow(ub - 1 + ub - n, n, &mx)) mx = 4e18;
      mx /= 2;
      return mn <= x && x <= mx;
    };
    rep(i, n) {
      int len = n - i;
      ll l = 0, r = len + (x - ll(len) * (len + 1) / 2);
      while (r - l > 1) {
        ll c = (l + r) / 2;
        (check(n - i - 1, x - c, c) ? r : l) = c;
      }
      ans[i] = r;
      x -= r;
    }
    rep(i, n) cout << ans[i] << " \n"[i + 1 == n];
  }
}