// C++ Program to find sum of Fibonacci numbers in 
// O(Log n) time.
#include <bits/stdc++.h>
using namespace std;
const long long MAX = LLONG_MAX;


// Driver program to test above function
int main()
{
	int t;
	cin>>t;
	while(t--){
		long long n,x;
		cin>>n>>x;
		if(n == 1){
			cout<<x<<"\n";
			continue;
		}
		vector<long long >ans;
		long long sum = 0;
		for(long long i=1; i<=x; i++){
			if(n == 1){
				if(x-sum>ans.back()){
					ans.push_back(x-sum);
					n--;
				}
				break;
			}
			sum+=i;
			ans.push_back(i);
			n--;
		}
		// cout<<ans.size()<<" " <<n<<endl;
		if(n){
			cout<<-1<<"\n";
			continue;
		}
		for(auto i: ans)
			cout<<i<<" ";
		cout<<"\n";
	}
}