#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    VI c((n-1)*(n-1));
    for (int& x : c) cin >> x;
    sort(all(c));
    rrep(i, (n-1)*(n-1)-1) c[i+1] -= c[i];
    VVI a(n, VI(n));
    rep(i, n - 1) rep(j, n - 1) {
      int v = c[i*(n-1)+j];
      a[i+1][j+1] += v;
      if (i+2 < n) {
        a[i+2][(j+1)%2] += v;
        a[i+2][j+1] -= v;
      }
    }
    rep(i, n) rep(j, n - 2) a[i][j+2] += a[i][j];
    rep(i, n - 2) rep(j, n) a[i+2][j] += a[i][j];
    rep(i, n) rep(j, n) cout << a[i][j] << " \n"[j + 1 == n];
  }
}