#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define all1(x) (x).begin() + 1, (x).end()

typedef long long LL;

mt19937 mrand(chrono::steady_clock().now().time_since_epoch().count());

// void solve(int n, int aim) {
void solve() {
    // cout << "aim : " << aim << endl;
    // int n; cin >> n;
    // LL val = 1LL << n;
    // int n = mrand() % 59 + 2, aim = mrand() % (n * (n + 1) / 2 - 1) + 2;
    // cout << n << " " << aim << endl;
    int n, aim; cin >> n >> aim;

    auto check_good = [&](V<LL> hav) -> bool {
        set<LL> st;
        for(auto x : hav) st.insert(x);
        bool ok = 1;
        for(auto x : hav) {
            for(auto y : hav) {
                if(st.count(x & y) == 0) ok = 0;
                if(st.count(x | y) == 0) ok = 0;
                if(ok == 0) break;
            }
        }
        assert(st.count(0));
        assert(st.count((1LL << n) - 1));
        return ok;
    };

    // int aim = n * (n + 1) / 2;
    
    // n - __log(aim)



    int now = __lg(aim);
    if(aim == 1LL << now) now--;

    int base = now;
    LL part_bef = 0;
    int to_add = base;

    V<LL> ans;

    while(aim) {
        // cout << aim << " " << now << endl;
        if(aim == 1LL << now) {
            while(to_add < n) {
                part_bef += 1LL << to_add;
                to_add++;
            }
        }

        LL cur_part_bef_shuffle = part_bef;
        for(int i = base - 1, cnt = 1; cnt <= base - now; cnt++, i--) {
            cur_part_bef_shuffle += 1LL << i;
            // cout << "fuck" << endl;
        }

        for(int i = 0; i < (1 << now); i++) {
            // cout << aim << endl;
            ans.pb(cur_part_bef_shuffle + i);
            // cout << "fuck1" << endl;
        }

        aim -= 1LL << now;
        now = __lg(aim);
        part_bef += 1LL << to_add;
        to_add++;
    }

    assert(check_good(ans));
    // cout << "OK" << endl;
    for(auto x : ans) cout << x << ' ', assert(x >= 0);
    cout << endl;
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    // for(int aim = 1; aim <= (1 << 4))
    // solve(5, 15);
    // for(int n = 2; n <= 60; n++) {
    //     for(int i = 2; i <= (n + 1) * (n) / 2; i++) solve(n , i);
    // }
    int t; cin >> t;
    while(t--) solve();
}