#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;
}

bool check(vector<int> arr, int n, int m) {
    set<int> st;
    for (int x : arr) {
        st.insert(x);
    }
    assert(st.size() == m && arr.size() == m);
    assert(st.count(0) && st.count((1ll << n) - 1));
    for (int x : arr) {
        for (int y : arr) {
            if (!st.count(x & y) || !st.count(x | y)) {
                return false;
            }
        }
    }
    return true;
}

vector<int> mem = {0, 8, 12, 16, 17, 18, 19, 24, 25, 26, 27, 28, 29, 30, 31};

void solve() {
    int n, m;
    cin >> n >> m;
    /// m = n * (n + 1) / 2;
    if (n == 5 && m == 15) {
        for (int x : mem) {
            cout << x << " ";
        }
        cout << "\n";
        return;
    }
    auto res = get(m);
    int n1 = res.second;
    if (n < n1) {
        cout << "bad! " << n << endl;
        exit(0);
    }
    int add = (1ll << n) - (1ll << n1);
    for (int& x : res.first) {
        if (x % 2 == 1) {
            x += add;
        }
        cout << x << " ";
    }
    /**if (!check(res.first, n, m)) {
        cout << "! " << n << " " << m << endl;
        exit(0);
    }*/
    cout << "\n";
}

void get(int mask, int id) {
    int cnt = __builtin_popcountll(mask);
    if (cnt > 15) return;
    if (cnt == 15) {
        cout << "found! " << endl;
        for (int i = 0; i < 32; ++i) {
            if (mask & (1ll << i)) {
                cout << i << ", ";
            }
        }
        cout << endl;
        exit(0);
    }
    if (id == 32) return;
    get(mask, id + 1);
    if (mask & (1ll << id)) {
        return;
    }
    int mask1 = (mask | (1ll << id));
    for (int i = 0; i < 32; ++i) {
        if ((mask & (1ll << i)) == 0) continue;
        int j = i & id;
        if (j < id && ((mask & (1ll << j)) == 0)) return;
    }
    for (int i = 0; i < 32; ++i) {
        if ((mask & (1ll << i)) == 0) continue;
        int j = i | id;
        mask1 |= (1ll << j);
    }
    get(mask1, id + 1);
}

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

    /// get((1ll << 31) + 1, 1);
    /// assert(check(mem, 5, 15));

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