#include<bits/stdc++.h>

#define fi first
#define se second
#define pb push_back

using namespace std;

typedef long long ll;
#define int ll

set<int> st(int n, int m)
{
    if (n == 0)
        return {};

    if (m <= n + 1)
    {
        set<int> res;
        int s = 0;
        for (int i=1; i<m; i++)
            res.insert(s), s = 2*s + 1;
        res.insert({(1ll<<n) - 1});
        return res;
    }

    if (m%2 == 0)
    {
        set<int> r = st(n-1, m/2);
        if (r.empty())
            return {};
        set<int> res;
        for (int i : r)
        {
            res.insert(2*i);
            res.insert(2*i+1);
        }
        return res;
    }
    else
    {
        set<int> r = st(n-1, m-1);
        if (r.empty())
            return {};
        set<int> res = {(1<<n) - 1};
        for (int i : r)
            res.insert(2*i);
        return res;
    }
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin>>t;
    while (t--)
    {
        int n, m;
        cin>>n>>m;
        if (n==5 && m==15)
        {
            for (int i: st(2, 3))
                for (int j : st(3, 5))
                    cout<<(i<<3)+j<<" ";
            cout<<"\n";
            continue;
        }

        for (int i : st(n, m))
            cout<<i<<" ";
        cout<<"\n";
    }
//    for (int n = 2; ; n++)
//        for (int m = 2; m<=n*(n+1)/2; m++)
//            if (st(n, m).empty())
//                cout<<"WA "<<n<<" "<<m<<endl;
}