#include <bits/stdc++.h>
using namespace std;
const int N = 103;
int r[N][N];
const int M = 1e5;
bool isP[M];
void init2() {
  for (int i = 2; i < M; ++i) {
    if (!isP[i]) {
      for (int j = i + i; j < M; j += i) isP[j] = true;
    }
  }
  isP[1] = true;
}
void solve2() {
  int n, m;
  scanf("%d ", &n);
  memset(r, 0, sizeof(r));
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) r[i][j] = 1;
  int x = 1;
  while (true) {
    if (!isP[(n - 1) + x] && isP[x]) {
      break;
    }
    ++x;
  }
  int total = (n - 1) * x;
  for (int i = 0; i < n; ++i) r[n - 1][i] = r[i][n - 1] = x;
  int t = 1;
  while (true) {
    if (!isP[(n - 1) * x + t] && isP[t]) {
      break;
    }
    ++t;
  }
  r[n - 1][n - 1] = t;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      printf("%d ", r[i][j]);
    }
    putchar('\n');
  }
}
void solve() {
  init2();
  int n;
  scanf("%d  ", &n);
  while (n--) {
    solve2();
  }
}
int main() {
  solve();
  return 0;
}
