#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define ls (r<<1)
#define rs (r<<1|1)
#define debug(a) cout << #a << " " << a << endl
using namespace std;
typedef long long ll;
const ll maxn = pow(2,10)+10;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ll inf = 1e9;
const double pi = acos(-1.0);
ll mapn[2*maxn][maxn];
int main() {
    ll T, p;
    scanf("%lld",&T);
    while(T--) {
        memset(mapn,0,sizeof(mapn));
        scanf("%lld",&p);
        for( ll i = 1; i <= 2*p; i ++ ) {
            for( ll j = 1; j <= p; j ++ ) {
                if( i <= p ) {
                    mapn[i][j] = ((i-1)+(j-1))%p;
                } else {
                    mapn[i][j] = (i-1)*(j-1)%p;
                }
                if( j != p ) {
                    printf("%lld ",mapn[i][j]);
                } else {
                    printf("%lld\n",mapn[i][j]);
                }
            }
        }
    }
    return 0;
}