#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long double PI = acos(-1);
const int N = 1e5 + 10;
const int MOD = 1e9 + 7;
const int mod1 = 998244353;
const long long INF = 2e18;
bool isPrime(int n) {
  if (n <= 1) return false;
  for (int i = 2; i < n; i++)
    if (n % i == 0) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int zz = 0;
    vector<int> v;
    for (int i = 2; i < 10000; i++) {
      if (isPrime(i)) {
        v.push_back(i);
      }
    }
    if (isPrime(n)) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          cout << 1 << " ";
        }
        cout << "\n";
      }
    } else {
      for (int i = 0; i < (int)v.size(); i++) {
        if (v[i] > n && isPrime(v[i] - (n - 1)) == false) {
          zz = v[i];
          break;
        }
      }
      for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n; j++) {
          if (j < n - 1) {
            cout << 1 << " ";
          } else {
            cout << (zz - (n - 1));
          }
        }
        cout << "\n";
      }
      for (int i = 0; i < n - 1; i++) {
        cout << (zz - (n - 1)) << " ";
      }
      int temp = (zz - (n - 1));
      temp *= (n - 1);
      for (int i = 0; i < 10000; i++) {
        if (isPrime(temp + i) && isPrime(i) == false) {
          cout << i << "\n";
          break;
        }
      }
    }
  }
  return 0;
}
