#include <bits/stdc++.h>
using namespace std;
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
const long double pie = 3.1415926535897932384626;
const long long N = 2e5 + 9;
bool prime(long long n) {
  long long flag = 1;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      flag = 0;
      break;
    }
  }
  if (n <= 1)
    flag = 0;
  else if (n == 2)
    flag = 1;
  if (flag == 1) {
    return false;
  } else {
    return true;
  }
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long primes[] = {2,   3,   5,   7,   11,  13,  17,  19,  23,  29,  31,
                          37,  41,  43,  47,  53,  59,  61,  67,  71,  73,  79,
                          83,  89,  97,  101, 103, 107, 109, 113, 127, 131, 137,
                          139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193,
                          197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257,
                          263, 269, 271, 277, 281, 283, 293};
    long long n;
    cin >> n;
    long long k;
    for (long long i = 0; i <= 61; i++) {
      if (primes[i] >= n && prime(primes[i] - n + 1) == true) {
        k = primes[i];
        break;
      }
    }
    long long h = k - n + 1;
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < n; j++) {
        if (i == j) {
          cout << h << " ";
        } else {
          cout << 1 << " ";
        }
      }
      cout << "\n";
    }
  }
  return 0;
}
