#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;

bool cmp(pii p1, pii p2){
  int sum1 = p1.first + p1.second;
  int sum2 = p2.first + p2.second;
  if(sum1 != sum2)
    return sum1 < sum2;
  return p1.first < p2.first;
}

int32_t main(){
  int t ;
  cin >> t;
  while(t--){
    int n;
    cin >> n;
    vector<pii> vc;
    for(int i = 0; i < n; i++)
      for(int j = 0; j < n; j++)
	vc.push_back(make_pair(i, j));
    sort(vc.begin(), vc.end(), cmp);
    int ans[n][n];
    int x=1;
    for(pii p: vc)
      ans[p.first][p.second] = x++;
    for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++)
	cout << ans[i][j] << ' ';
      cout << endl;
    }
  }

}