#include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for (int i=(x);i<=(y);i++)
#define drep(i,y,x) for (int i=(y);i>=(x);i--)
#define pii pair<int,int>
#define fir first
#define sec second
#define MP make_pair
template<typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template<typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
void file() {
    #ifdef zqj
    freopen("a.in","r",stdin);
    #endif
}
typedef long long ll;
using u64 = unsigned long long;
void solve(int n, int m) {
	u64 z = 1ull<<n;
	static std::mt19937_64 gen(0);
	for(;;) {
		std::vector<u64> res = {0, (1ull << n) - 1};
		auto tryins = [&](u64 v) {
			auto iter = lower_bound(res.begin(), res.end(), v);
			if(iter == res.end() || *iter != v) {
				res.insert(iter, v);
				return 1;
			} else {
				return 0;
			}
		};
		static std::queue<u64> Q;
		for(;res.size() < m;) {
			if(Q.empty()) {
				u64 v = gen() % z;
				if(tryins(v)) Q.push(v);
			}
			for(;Q.size();) {
				u64 z = Q.front(); Q.pop();
				static u64 li[10000]; int cc = 0;
				for(u64 p : res) {
					li[cc++] = p & z;
					li[cc++] = p | z;
				}
				for(int i = 0;i < cc;++i) {
					u64 v = li[i];
					if(tryins(v)) Q.push(v);
				}
			}
		}
		if(res.size() == m) {
            
            for (auto x:res) cout<<x<<' ';
            cout<<'\n';
            return;
        }
	}

}

void work(int n, int m) {
    --m;
    int _n=0;
    vector<int>s({0});
    int k=30; while (!(m>>k)) k--;
    drep(i,k-1,0) {
        vector<int>t=s;
        for (auto x:t) s.push_back(x|(1ll<<_n));
        ++_n;
        if (m>>i&1) {
            ++_n;
            s.push_back((1ll<<_n)-1);
        }
    }
    set<ll>S(s.begin(),s.end());
    assert(_n<n);
    S.insert((1ll<<n)-1);
    assert((int)S.size()==m+1);
    for (auto x:S) for (auto y:S) assert(S.count(x&y)&&S.count(x|y));
    assert(S.count(0)&&S.count((1ll<<n)-1));
    for (auto x:S) cout<<x<<' ';
    cout<<'\n';
}

int main() {
    file();
    ios::sync_with_stdio(false), cin.tie(0);
    int T; cin>>T;
    while (T--) {
        int n,m;
        cin>>n>>m;
        if(n <= 8) {
            // std::cerr<<n<<' '<<m<<std::endl;
            solve(n, m);
        } else {
            work(n, m);
        }
    }
    return 0;
}