#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(x) x.begin(), x.end()
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
#include <atcoder/all>
using namespace atcoder;
//using mint=static_modint<998244353>;
using mint=static_modint<1000000007>;

void solve(){
	ll n,x;cin>>n>>x;
	if(n*(n+1)>x*2){
		cout<<-1<<endl;
		return;
	}
	rep(i,n-1)cout<<i+1<<" ";
	cout<<x-n*(n-1)/2<<endl;
}

int main(){
	ll t;cin>>t;
	rep(i,t)solve();
}