#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>

#include <memory.h>
#include <assert.h>

#define y0 sdkfaslhagaklsldk

#define y1 aasdfasdfasdf
#define yn askfhwqriuperikldjk
#define j1 assdgsdgasghsf
#define tm sdfjahlfasfh
#define lr asgasgash
#define norm asdfasdgasdgsd
#define have adsgagshdshfhds
#define ends asdgahhfdsfshdshfd
#define right asdashgasrhsdf

#define eps 1e-14
#define M_PI 3.141592653589793
#define bs 1000000007
#define bsize 64

#define ldouble long double

using namespace std;

long long INF = 1e9;
const int N = 600031;

long long min_iters[N],max_iters[N];
int n;

int tests,need;
vector<int> res;

void solve(int len,long long need,int ohead){

	//cout<<len<<" "<<need<<" "<<ohead<<endl;
	if (len==1)
	{
		res.push_back(ohead+1);
		return ;
	}
	if (len==0)
		return ;

	need-=len-1;

	for (int len_pref=0;len_pref<len;len_pref++)
	{
		int len_suf=len-len_pref-1;
		long long lwr=min_iters[len_pref]+min_iters[len_suf];
		long long upr=max_iters[len_pref]+max_iters[len_suf];
		if (need>=lwr&&need<=upr)
		{
			long long in1=min_iters[len_pref];
			long long in2=min_iters[len_suf];
			need-=in1;
			need-=in2;
			long long ad=min(need,max_iters[len_pref]-min_iters[len_pref]);
			in1+=ad;
			need-=ad;
			in2+=need;

			res.push_back(ohead+len_pref+1);

			solve(len_pref,in1,ohead);

			solve(len_suf,in2,ohead+len_pref+1);
			return ;
		}
	}
}

int main(){
	//freopen("tree.in","r",stdin);
	//freopen("tree.out","w",stdout);
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	ios_base::sync_with_stdio(0);
	//cin.tie(0);

	min_iters[1]=max_iters[1]=0;

	for (int i=2;i<N;i++)
	{
		max_iters[i]=max_iters[i-1]+(i-1);
		int one_half=i/2;
		int other_half=i-i/2-1;
		min_iters[i]=min_iters[one_half]+min_iters[other_half]+i-1;
	}

	/*for (int i=2;i<=100;i++)
	{
		cout<<min_iters[i]<<" "<<max_iters[i]<<endl;
	}*/

	cin>>tests;
	for (;tests;--tests)
	{
		cin>>n>>need;
		if (need<min_iters[n]||need>max_iters[n])
		{
			cout<<-1<<endl;
			continue;
		}
		res.clear();
		solve(n,need,0);
		for(int i=0;i<res.size();i++)
		{
			if (i)
				cout<<" ";
			cout<<res[i];
		}
		cout<<endl;
	}

	cin.get(); cin.get();
	return 0;
}