#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
const int N = 1e5 + 5, MOD = 1e9 + 7;

ll L[N], R[N];

void calc(int n, ll c, int offset){
	//cout<<"DBG --> "<<n<<" "<<c<<" "<<offset<<endl;
	if(n == 0)	return ;
	if(n == 1){
		cout<<offset + 1<<" ";
		return ;
	}
	int lo = 1, hi = (n / 2) + (n % 2);
	while(lo <= hi){
		int mid = (lo + hi)/2;
		ll cntL = R[mid - 1] + L[n - mid] + (n - 1), cntR = R[mid - 1] + R[n - mid] + (n - 1);
		//cout<<"WTF --> "<<mid<<" "<<cntL<<" "<<cntR<<endl;
		if(c >= cntL and c <= cntR){
			cout<<offset + mid<<" ";
			calc(mid - 1, R[mid - 1], offset);
			calc(n - mid, c - R[mid - 1] - n + 1, offset + mid);
			return ;
		}
		else if(c > cntR)	hi = mid - 1;
		else lo = mid + 1;
	}
}

void solve(){
	int len;
	ll c;
	cin>>len>>c;
	if(c < L[len] or c > R[len]){
		cout<<-1<<endl;
		return ;
	}
	calc(len, c, 0);
	cout<<endl;
}
  
int main(){

	L[0] = R[0] = L[1] = R[1] = 0;
	L[2] = R[2] = 1;
	for(int i = 3; i < N; i++){
		if((i % 2) == 0)	L[i] = (i - 1) + L[i / 2] + L[(i / 2) - 1];
		else L[i] = (i - 1) + 2*L[i / 2];
		R[i] = (i - 1) + R[i - 1];
	}

	//for(int i = 0; i < N; i++)	cout<<i<<" --> "<<L[i]<<" "<<R[i]<<endl;

	int t;
	cin>>t;
	while(t--)	solve();
	return 0;
}