#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int t, cnt, sum[21000006], n, m, now;
inline void dfs(int p, int lst = m) {
	if (p == n ) {
		sum[++cnt] = now % m;
		return;
	}
	for (int i = lst; i >= 1; i--) {
		now += i - 1;
		dfs(p + 1, i);
		now -= i - 1;
	}
}
signed main() {
//	freopen("text.in", "r", stdin);
//	freopen("text.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> t;
	while (t--) {
		cin >> n >> m;
		cnt = now = 0;
		dfs(1);
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= cnt; j++) {
				cout << (sum[j] + i) % m + 1 << ' ';
			}
			cout << "\n";
		}
	}
}
//这玩意到底按什么顺序输出啊，真没看懂