#include <bits/stdc++.h>
#define LL long long
int T,N,M;
std::vector<LL> sv(int N,int M) {
	if(M==2) {
		std::vector<LL> tp;
		tp.push_back(0);
		tp.push_back((1ll<<N)-1);
		return tp;
	}
	if(M<=N*(N-1)/2) {
		std::vector<LL> tp=sv(N-1,M);
		for(int i=0;i<tp.size();i++) tp[i]=tp[i]*2+(tp[i]&1);
		return tp;
	}
	if(M%2==0) {
		std::vector<LL> tp=sv(N-1,M/2),tq;
		for(int i=0;i<tp.size();i++) {
			tq.push_back(tp[i]*2);
			tq.push_back(tp[i]*2+1);
		}
		return tq;
	}
	if(N==5&&M==15) {
		std::vector<LL> tp;
		//0 1 3 4 5 7 12 13 15 20 21 23 28 29 31
		tp.push_back(0);
		tp.push_back(1);
		tp.push_back(3);
		tp.push_back(4);
		tp.push_back(5);
		tp.push_back(7);
		tp.push_back(12);
		tp.push_back(13);
		tp.push_back(15);
		tp.push_back(20);
		tp.push_back(21);
		tp.push_back(23);
		tp.push_back(28);
		tp.push_back(29);
		tp.push_back(31);
		return tp;
	}
	std::vector<LL> tp=sv(N-1,M-1);
	std::vector<LL> tq;
	tq.push_back(0);
	for(int i=0;i<tp.size();i++) {
		tq.push_back(tp[i]*2+1);
	}
	return tq;
}
signed main(void) {
	scanf("%d",&T);
	while(T--) {
		scanf("%d %d",&N,&M);assert(2<=M&&M<=N*(N+1)/2);
		std::vector<LL> tp=sv(N,M);
		for(int i=0;i<tp.size();i++) {
			printf("%lld ",tp[i]);
		}
		for(int j=1;j<tp.size();j++) assert(tp[j-1]<tp[j]);
		printf("\n");
	}
}