#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e3+5,M=N*10+5,K=1000+5,mod=998244353,Mod=+-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,m,dp[N];
vector<ll> construct(int m){
	if(m==1) return {0};
	for(int i=1;i<=60;i++){
		int x=i,siz=i;
		if(m>=x&&dp[m]==dp[m-x]+siz){//gdb("add",m,x);
			auto p=construct(m-x);
			ll y=(1ll<<dp[m])-1;
			for(int j=1;j<=siz;j++) p.emplace_back((y>>j-1)<<j-1);
			return p;
		}
	}
	for(int i=1;i<=20;i++){
		int x=(1<<i)-1,siz=i;
		if(m>=x&&dp[m]==dp[m-x]+siz){//gdb("pow",m,x);
			auto p=construct(m-x);
			ll y=(1ll<<dp[m])-1;
			for(int j=0;j<(1<<siz)-1;j++) p.emplace_back(y^j); 
			return p;
		}
	}
	for(int i=2;i<m;i++) if(dp[m]==dp[i]+dp[m-i+1]){//gdb("merge",m,i);
		auto p=construct(i),q=construct(m-i+1);
		for(ll i:p) q.emplace_back((i+1<<dp[m-i+1])-1);
		return q;
	}
	for(int i=2;i<m;i++) if(m%i==0&&dp[m]==dp[i]+dp[m/i]){//gdb("mul",m,i);
		auto p=construct(i),q=construct(m/i);
		vector<ll> ans;
		for(ll x:p) for(ll y:q) ans.emplace_back(x<<dp[m/i]|y);
		return ans;
	}
	assert(0);
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	vector<ll> p=construct(m);
	for(ll &i:p){
		for(int j=1;j<=n-dp[m];j++) i=i<<1|(i&1);
	}
	assert(p.size()==m);
	assert(find(p.begin(),p.end(),0)!=p.end());
	assert(find(p.begin(),p.end(),(1ll<<n)-1)!=p.end());
	for(ll x:p) for(ll y:p){
		if(find(p.begin(),p.end(),x|y)==p.end()) gdb(x,y);
		assert(find(p.begin(),p.end(),x&y)!=p.end());
		assert(find(p.begin(),p.end(),x|y)!=p.end());	
	}
	for(ll i:p) printf("%lld ",i);printf("\n");
}
const int lim=30*61;
void init(){
	Me(dp,0x3f);dp[1]=0;
	for(int i=0;i<=60;i++){
		int x=i,siz=i;
		for(int h=x;h<=lim;h++) dp[h]=min(dp[h],dp[h-x]+i);
	}
	gdb(dp[2],dp[5]);
	for(int i=0;i<=20;i++){
		int x=(1<<i)-1,siz=i;
		for(int h=x;h<=lim;h++) dp[h]=min(dp[h],dp[h-x]+siz);
	}
	for(int i=1;i<=lim;i++){
		for(int j=1;j<=i;j++) dp[i]=min(dp[i],dp[j]+dp[i-j+1]);
		for(int j=1;i*j<=lim;j++) dp[i*j]=min(dp[i*j],dp[i]+dp[j]);
	}
	for(int i=2;i<=lim;i++){
		int x=dp[i];
		if(x*(x-1)/2>=i) gdb(i,x);
	}
}
int main(){
	int t=1;init();
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}