#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,N,C[707*707];

int A[707][707];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>N;
		FOR(i,(N-1)*(N-1)) cin>>C[i];
		sort(C,C+(N-1)*(N-1));
		
		FOR(x,N) FOR(y,N) A[y][x]=0;
		int cur=0;
		for(y=1;y<N;y++) {
			if(y%2) {
				for(x=1;x<N;x++) {
					A[y][x]=C[cur++]-A[y-1][x-1]-A[y-1][x]-A[y][x-1];
				}
			}
			else {
				for(x=N-2;x>=0;x--) {
					A[y][x]=C[cur++]-A[y-1][x+1]-A[y-1][x]-A[y][x+1];
				}
			}
		}
		FOR(y,N) {
			FOR(x,N) cout<<A[y][x]<<" ";
			cout<<endl;
		}
		
		
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}