#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

#define int int64_t

pair<vector<int>, int> get(int m) {
    if (m == 2) {
        return {{0, 1}, 1};
    }
    if (m % 2 == 0) {
        auto res = get(m / 2);
        vector<int> ans;
        int n = res.second;
        for (int x : res.first) {
            ans.push_back(x);
            ans.push_back(x + (1ll << n));
        }
        return {ans, n + 1};
    }
    auto res = get(m - 1);
    res.second++;
    res.first.push_back((1ll << res.second) - 1);
    return res;
}

void solve() {
    int n, m;
    cin >> n >> m;
    auto res = get(m);
    int n1 = res.second;
    int add = (1ll << n) - (1ll << n1);
    for (int& x : res.first) {
        if (x % 2 == 1) {
            x += add;
        }
        cout << x << " ";
    }
    cout << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    
    return 0;
}