#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 false;
	}
	sum=N*(N-1)/2+a;
	if(sum>X){
		return false;
	}
	return true;
}

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;
		vector<int> A(N);
		bool check=false;
		for(int i=N;i>=2;i--){
			int r=X-i*(i-1)/2;
			int l=(i*i+i+2*X-1)/(2*i);
			if(i!=N){
				r=min(A[N-i-1],r);
			}
			if(l>r){
				cout << -1 << endl;
				check=true;
				break;
			}
			A[N-i]=l;
			X-=l;
		}
		A[N-1]=X;
		if(check){
			continue;
		}
		if(A[N-1]>=A[N-2]){
			cout << -1 << endl;
			continue;
		}
		A[N-1]=X;
		for(int i : A){
			cout << i << " ";
		}
		cout << endl;
	}
}