#include <bits/stdc++.h>
using namespace std;
int a[101][101];
bool prime[1001];
int p[1001];
int k;
void primes() {
  k = 0;
  memset(prime, true, sizeof(prime));
  prime[0] = prime[1] = false;
  for (int i = 2; i <= 1000; i++) {
    if (prime[i]) {
      p[k++] = i;
      for (int j = i * i; j <= 1000; j += i) prime[j] = false;
    }
  }
}
bool isprime(int x) {
  if (x == 1 || x == 0) return false;
  if (x == 2) return true;
  for (int i = 2; i <= sqrt(x); i++)
    if (x % i == 0) return false;
  return true;
}
int main() {
  primes();
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        a[i][j] = 1;
      }
    }
    int sum = 0;
    for (int i = 1; i <= n; i++) sum += a[i][1];
    if (isprime(sum)) {
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
          if (j == 1)
            cout << a[i][j];
          else
            cout << " " << a[i][j];
        }
        cout << endl;
      }
    } else {
      int x;
      for (int i = 0; i < k; i++) {
        if (p[i] > sum) {
          x = i;
          break;
        }
      }
      int y = p[x] - sum + 1;
      while (isprime(y)) {
        x++;
        y = p[x] - sum + 1;
      }
      for (int i = 1; i <= n; i++) a[i][i] = y;
      for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
          if (j == 1)
            cout << a[i][j];
          else
            cout << " " << a[i][j];
        }
        cout << endl;
      }
    }
  }
  return 0;
}
