#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
long long int power(long long int a, long long int b) {
  long long int res = 1;
  a = a % 1000000007;
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % 1000000007;
      b--;
    }
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  return (b == 0) ? a : gcd(b, a % b);
}
bool isp(long long int x) {
  long long int c = 0;
  for (long long int i = 2; i < x; i++) {
    if (x % i == 0) c++;
  }
  return (c == 0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  set<long long int> primes;
  for (long long int i = 2; i <= 400; i++) {
    if (isp(i)) primes.insert(i);
  }
  long long int t;
  cin >> t;
  while (t--) {
    long long int n;
    cin >> n;
    long long int x;
    for (auto i : primes) {
      long long int lef = i - n + 1;
      if (lef < 0) continue;
      if (primes.find(lef) != primes.end()) continue;
      x = lef;
      break;
    }
    vector<long long int> v(n, 1);
    v[n - 1] = x;
    for (long long int i = 0; i < n; i++) {
      for (long long int j = 0; j < n; j++) cout << v[(i + j) % n] << " ";
      cout << "\n";
    }
  }
}
