#include<bits/stdc++.h>
#define il inline
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define pii pair<int, int>
#define fr first
#define sc second
#define ll long long
#define eb emplace_back
#define mset(f, z) memset(f, z, sizeof(f))
#define mcpy(f, g) memcpy(f, g, sizeof(g))
using namespace std;
template<typename T=ll>
il T rd(){
	T s=0; bool f=1; char c=getchar();
	while(!isdigit(c)) f^=(c=='-'), c=getchar();
	while(isdigit(c)) s=s*10+c-'0', c=getchar();
	return f? s:-s;
}
template<typename T> il void ckmx(T &x, T y){if(x<y) x=y;}
template<typename T> il void ckmn(T &x, T y){if(y<x) x=y;}
char _begin;

int n, m, p;

ll real(int l, int r){ll re=0; for(int i=l; i<=r; i++) re|=1ll<<i; return re;}
ll holl(int l, int r){ll re=0; for(int i=l; i<=r; i++) re|=(i!=p)*1ll<<i; return re;}

void solve(){
	n=rd(), m=rd();
	if(m==2) return printf("%lld %lld\n", 0ll, (1ll<<n)-1), void();
	vector<ll> ans;
	//
	#define insert(l, r) \
	{ \
		ans.eb(real(l, r)); \
		ans.eb(holl(l, r)); \
		m-=2; \
		if(m<2) goto finish; \
	}
	//
	p=n/2;
	insert(p, p);
	ans.eb(real(0, n-1)), m--;
	if(m>=2)
	for(int i=1; p-i>=0 && p+i<n; i++){
		if(p-i>0 || p+i!=n-1) insert(p-i, p+i);
		for(int j=i-1; ~j; j--) insert(p-i, p+j);
		for(int j=i-1; ~j; j--) insert(p-j, p+i);
	}
	if(m && n%2==0){
		for(int i=n-2; i>=p; i--){
			ans.eb(real(0, i));
			if(!--m) goto finish;
		}
	}
	finish:;
	if(m) ans.eb(holl(0, n-1));
	for(ll i:ans) printf("%lld ", i);
	puts("");
}

char _end;
signed main(){
	debug("%lfMB\n", (&_end-&_begin)/1024./1024.);
	int T=rd();
	while(T--) solve();
	return 0;
}