#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
int t, cnt, sum[2100006], n, m, now, jie[10005];
inline void dfs(int p) {
	if (p == m) {
		sum[++cnt] = now % m;
		return;
	}
	for (int i = 1; i <= m; i++) {
		now += i;
		dfs(p + 1);
		now -= i;
	}
}
inline void solve(int pre, int suf, int ssum) {
	for (int i = 1; i <= jie[pre]; i++) {
		for (int j = 1; j <= cnt; j++) {
			int p = (ssum - sum[j] + m) % m;
			if (!p) p = m;
			for (int k = 1; k <= jie[suf]; k++) {
				cout << p << ' ';
			}
		}
	}
	cout << "\n";
}
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;
		jie[0] = 1;
		for (int i = 1; i <= n; i++) {
			jie[i] = jie[i - 1] * m;
		}
		if (n < m) {
			for (int i = 1; i <= n; i++) {
				for (int j = 1; j <= jie[n - 1]; j++) {
					cout << 1 << ' ';
				}
				cout << "\n";
			}
			continue;
		}
		cnt = 0, now = 0;
		dfs(1);
		for (int i = 1; i <= n / m; i++) {
			for (int j = (i - 1) * m + 1; j <= i * m; j++) {
				solve((i - 1)*m, n - i * m, j % m);
			}
		}
		for (int i = (n / m) * m + 1; i <= n; i++) {
			for (int j = 1; j <= jie[n - 1]; j++) {
				cout << 1 << ' ';
			}
			cout << "\n";
		}
	}
}