#include<bits/stdc++.h>
using namespace std;
#define int long long

bool solve(int N,int X,int a){
	//A[0]==aのとき可能か
	//a+(a-1)+...+(a-N+1)
	//(2*a-N+1)*N/2
	int sum=(2*a-N+1)*N/2;
	if(sum>=X){
		return true;
	}
	return false;
}

int solve2(int N,int X,int r){
	int l=N-1;
	while((r-l)>1){
		int m=(l+r)/2;
		if(solve(N,X,m)){
			r=m;
			continue;
		}
		l=m;
	}
	return r;
}

signed main() {
	int T;
	cin >> T;
	for(;T--;){
		int N,X;
		cin >> N >> X;
		int sum=N*(N+1)/2;
		if(sum>X){
			cout << -1 << endl;
			continue;
		}
		int k=1000000000000000000LL;
		sum=0;
		int x=X;
		vector<int> A(N);
		for(int i=N;i>=2;i--){
			int t=solve2(i,X,k);
			sum+=t;
			A[N-i]=t;
			k=t-1;
			X-=t;
		}
		A[N-1]=x-sum;
		if((x-sum)<=0){
			cout << -1 << endl;
		}
		for(int i : A){
			cout << i << " ";
		}
		cout << endl;
	}
}