#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int Q;
ll L,C;

ll mi[1010101];
ll ma[1010101];
vector<int> V;

void hoge(int A,int B,ll C) {
	int i;
	if(B<A) return;
	if(A==B) {
		V.push_back(A);
		return;
	}
	if(ma[B-A+1]==C) {
		for(i=A;i<=B;i++) V.push_back(i);
		return;
	}
	
	for(int i=0;i<=B-A;i++) {
		int x=i;
		int y=B-A+1-1-i;
		if(ma[y]+ma[x]+(B-A)>=C && ma[y]+mi[x]+(B-A)<=C) {
			C-=B-A;
			V.push_back(A+i);
			hoge(A+i+1,B,ma[y]);
			hoge(A,A+i-1,C-ma[y]);
			return;
		}
	}
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	for(i=2;i<=1000100;i++) {
		ma[i]=(i-1)+ma[i-1];
		x=i/2;
		mi[i]=(i-1)+mi[(i-1)/2]+mi[(i-1)-(i-1)/2];
	}
	
	cin>>Q;
	while(Q--) {
		cin>>L>>C;
		if(C<mi[L] || ma[L]<C) {
			cout<<-1<<endl;
			continue;
		}
		V.clear();
		hoge(1,L,C);
		FOR(i,V.size()) _P("%d%c",V[i],(i==V.size()-1)?'\n':' ');
		
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}