Untitled

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef tree<int, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define AboTaha_on_da_code ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define X first
#define Y second

const int dx[8]={0, 0, 1, -1, 1, -1, -1, 1};
const int dy[8]={1, -1, 0, 0, 1, -1, 1, -1};
const double EPS = 1e-8;
const int mod = 1e9+7; // 1e9+7, 998244353
const int phi = 1e9+6; // 1e9+7, 998244353
// BEFORE coding are you sure you understood the statement correctly?
// PLEASE do not forget to read the sample explanation carefully.
// WATCH out for overflows & RTs in general.
// TEST your idea or code on the corner cases.
// ANALYZE each idea you have thoroughly.

vector <int> go(vector <int> &a, int bt = 0) {
    if (a.size() == 1) return a;
    vector <int> on, off;
    for (auto &i : a) {
        if (i>>bt&1) on.push_back(i);
        else off.push_back(i);
    }
    on = go(on, bt+1), off = go(off, bt+1);
    for (auto &i : off) on.push_back(i);
    return on;
}

void burn(int tc) {
    int n; cin >> n;
    vector <int> a(n);
    iota(a.begin(), a.end(), 1);
    a = go(a);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cout << a[j]+a[i]*n-n << ' ';
        }
        cout << '\n';
    }
}

int main()
{
    AboTaha_on_da_code

//    freopen("points.in", "r", stdin);
//    freopen("output.txt", "w", stdout);

    int T = 1; cin >> T;

    for (int i = 1; i <= T; i++) {
//        cout << "Case " << i << ": ";
        burn(i);
        cout << '\n';
    }
    return (0-0);
}