#include <bits/stdc++.h>
using namespace std;
int main() {
  bool prime[100001];
  prime[0] = prime[1] = false;
  prime[2] = prime[3] = true;
  for (long long i = 4; i <= 100000; i++) {
    long long f = 0;
    for (long long j = 2; j * j <= i; j++) {
      if (i % j == 0) {
        f = 1;
        break;
      }
    }
    if (f == 0)
      prime[i] = true;
    else
      prime[i] = false;
  }
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> v;
    for (long long i = 0; i < n - 1; i++) v.push_back(1);
    for (long long i = 1; i <= 100000; i++) {
      if (prime[n - 1 + i] && !prime[i]) {
        v.push_back(i);
        break;
      }
    }
    for (long long i = 0; i < n; i++) {
      long long j = i;
      cout << v[j] << " ";
      j = (j + 1) % n;
      for (; j != i; j = (j + 1) % n) cout << v[j] << " ";
      cout << endl;
    }
  }
}
