#include <bits/stdc++.h>
using namespace std;
const long long LINF = 1000000005ll * 1000000005ll;
const int INF = 1000000005;
const int N = 100005;
vector<int> p;
map<int, bool> pr;
bool prime(int number) {
  if (number == 2) return true;
  if (number % 2 == 0) return false;
  for (int i = 3; i * i <= number; i++) {
    if (number % i == 0) return false;
  }
  return true;
}
void solve() {
  int n, num = 0;
  cin >> n;
  for (int i = 0; i < p.size(); i++) {
    if (p[i] >= n && !pr[p[i] - n + 1]) {
      num = p[i] - n + 1;
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i == j) {
        cout << num << " ";
      } else {
        cout << 1 << " ";
      }
    }
    cout << endl;
  }
}
void precalc() {
  for (int i = 2; i < 500; i++) {
    if (prime(i)) {
      p.push_back(i);
      pr[i] = true;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  precalc();
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
