// LUOGU_RID: 98548204
#include<bits/stdc++.h> 
#define pii pair<int,int>
using namespace std;
const int MAXN=2e5+1;
int cnt[MAXN];
inline void solve() {
	int n,m,k;
	scanf("%d%d%d",&n,&m,&k);
	int s1=n/m+1,c1=n%m,s2=n/m,c2=m-n%m;
	for(int i=1;i<=n;++i) cnt[i]=0;
	for(int t=1;t<=k;++t) {
		priority_queue <pii,vector<pii>,greater<pii> > q;
		for(int i=1;i<=n;++i) q.push(make_pair(cnt[i],i));
		for(int j=1;j<=c1;++j) {
			printf("%d ",s1);
			for(int k=1;k<=s1;++k) {
				int x=q.top().second; q.pop();
				++cnt[x];
				printf("%d ",x);
			}
			puts("");
		}
		for(int j=1;j<=c2;++j) {
			printf("%d ",s2);
			for(int k=1;k<=s2;++k) {
				int x=q.top().second; q.pop();
				printf("%d ",x);
			}
			puts("");
		}
	}
	puts("");
}
signed main() {
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}