#include<bits/stdc++.h>
using namespace std;

using ll=long long;
using pii=pair<int,int>;
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())

const int N=405,mod=998244353;

int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int sub(int x, int y){x-=y; if(x<0) x+=mod; return x;}
int mul(int x, int y){return 1ll*x*y%mod;}
int Pow(int x, ll y=mod-2){int res=1; for(; y; y>>=1,x=mul(x,x)) if(y&1) res=mul(res,x); return res;}

int dp[2222];

vector<ll> get(int n, int m){
    if(m==2) return {0,(1ll<<n)-1};
    if(n==5&&m==15){
        vector<ll> a=get(2,3),b=get(3,5);
        vector<ll> res;
        for(auto i: a) for(auto j: b) res.pb((i<<3)+j);
        return res;
    }
    if(m&1){
        vector<ll> res=get(n-1,m-1);
        res.pb((1ll<<n)-1);
        return res;
    }
    vector<ll> res=get(n-1,m/2);
    for(int i=0; i<m/2; ++i) res.pb((1ll<<n-1)+res[i]);
    return res;
}

bool check(vector<ll> a){
    for(int i=0; i<sz(a); ++i) for(int j=i+1; j<sz(a); ++j){
        ll x=a[i]&a[j];
        if(!binary_search(all(a),x)) return false;
        x=a[i]|a[j];
        if(!binary_search(all(a),x)) return false;
    }
    return true;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int t; cin >> t;
    while(t--){
        int n,m; cin >> n >> m;
        vector<ll> res=get(n,m);
        sort(all(res));
        assert(check(res));
        for(auto i: res) cout << i << ' ';
        cout << "\n";
    }
}