#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 9;
int a[maxn];
int ans[209];
void prime(int n) {
  a[1] = 1;
  for (int i = 2; i <= n; ++i) {
    if (a[i]) {
      continue;
    }
    for (int j = 2; i * j <= n; ++j) {
      a[i * j] = 1;
    }
  }
}
int main() {
  int t;
  scanf("%d", &t);
  prime(100000);
  while (t--) {
    int n;
    scanf("%d", &n);
    int now = 1;
    while (1) {
      if ((!a[(n - 1) + now]) && (a[now])) {
        break;
      }
      now++;
    }
    for (int i = 1; i <= n; ++i) {
      for (int j = 1; j <= n; ++j) {
        if (i == j) {
          printf("%d ", now);
        } else {
          printf("1 ");
        }
      }
      putchar('\n');
    }
  }
  return 0;
}
