#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,c=getchar();
	while(c<'0'||c>'9')c=getchar();
	while(c>='0' && c<='9')x=x*10 + c-'0',c=getchar();
	return x;
}
int n,m;
#define lb(s) (s&-s)
#define pnp(s) __builtin_popcount(s)
#define bit(s,x) (((s)>>(x))&1)
inline void solve(){
	n=read(),m=read();
	if(n==5 && m==15){
		n=30,m=13;
		for(int s=(1<<m)-1;s<1<<n;s+=lb(s),s|=(1<<(m-pnp(s)))-1){
			//cout<<s<<endl;
			//assert(pnp(s)==m);
			int t[32]={0}; t[0]=t[31]=1;
			rep(i,1,30)if(bit(s,i-1))t[i]=1;
			bool fl=1;
			rep(i,0,31)rep(j,i+1,31)if(t[i]&&t[j])fl &= t[i&j] & t[i|j];
			if(fl){
				rep(i,0,31)if(t[i])printf("%d ",i);
				puts("");
				return ;
			}
		}
	}
	vector<ll>vec(1,0);
	ll cnt=0;
	per(i,__lg(m)-1,0){
		cnt=cnt<<1|1;
		vector<ll>tmp;
		for(auto x:vec)tmp.pb(x<<1),tmp.pb(x<<1|1);
		if((m>>i)&1){
			for(auto &x:tmp)x<<=1;
			tmp.pb(cnt=cnt<<1|1);
		}
		vec.swap(tmp);
	}
	assert(vec.size() == m);
	cnt ^= (1ll<<n)-1;
	for(auto &x:vec)if(x&1)x^=cnt;
	sort(vec.begin(),vec.end());
	for(auto x:vec)printf("%lld ",x);
	puts("");
}
int main(){
	//freopen("data.in","r",stdin);
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	int T=read();while(T--)solve();
}