#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

template<class T>
void print_sp(const T& a){
  bool first = true;
  for (auto&& x : a){
    if (!first) cout << ' ';
    first = false;
    cout << x;
  }
  cout << '\n';
} 
vl Cal(ll n,ll x){
  ll stc=(1+n)*n/2;
  if(stc>x)return {-1};
  vl ans(n);
  ll cnt=(x-stc-1)/n+1,to=0,idx=0;
  rep(i,0,n){
    if(i==0)ans[i]=n+cnt;
    else ans[i]=-1;
    to+=n+cnt-i;
  }
  to-=x;
  while(to>0){
    ll now=n-idx;
    if(now<=to){
      ans[idx]-=1;
      to-=now;
    }
    idx++;
  }
  rep(i,0,n-1){
    ans[i+1]+=ans[i];
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll t;cin>>t;
  while(t--){
    ll n,x;cin>>n>>x;
    print_sp(Cal(n,x));
  }
}