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


#define ll long long
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define rrep(i,a,b) for(int i=(a); i>=(b); --i)
#define all(x) (x).begin(), (x).end()
template<typename T>
void read(vector<T>& v){ for(auto &x:v) cin>>x; }

template<typename T>
void print(const vector<T>& v){
    for(const auto &x:v) cout<<x<<" ";
    cout<<"\n";
}


const ll MOD = 1e9+7;
// Unique Prime Factors.

int main(){
    ios::sync_with_stdio(false); 
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll T;
    cin >> T;
    while(T--){
        ll n;
        cin >> n;

        ll max_val = (1LL << n) - 1;
        vector<bool> used(max_val+1,0);

        ll curr = max_val;
        cout<<curr<<" ";
        used[curr] = true;

        for(ll i = n - 1; i >= 0; i--){
            if(curr > 0){
                curr -= (1LL << i);
                cout<<(curr)<<" ";
                used[curr] = true;

                for(ll j = 0; j <= max_val; j++){
                    if(!used[j] && (curr & j) == curr){
                        cout<<j<<" ";
                        used[j] = true;
                    }
                }
            }
        }
        for(int i = 0; i <= max_val; i++){
            if(!used[i]){
                cout << i << " ";
            }
        }
        cout << "\n";

    }
    return 0;
}