#include<bits/stdc++.h>
#define ll long long
#define rep(i,s,t) for(int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(int i=(s);i>=(t);i--)
using namespace std;
int ci(){
	int x; cin>>x; return x;
}

int n, m;

int a[33];
int ans[(int)3e6+5], tot;

void dfs(int cur, int c){
	if( cur==0 ){
		int cnt = 0, sum = 0;
		//int mx = 0;
		//rep(i,1,m) mx = max(mx, a[i]);
		//rep(i,1,m) if( a[i]==mx ) sum+=i-1, cnt++;
		rep(i,1,m) sum+=(i-1)*a[i];
		ans[++tot] = sum%m;
		//printf("line %d: mx %d sum %d %d\n", __LINE__, mx, sum, cnt);
		return;
	}
	rev_rep(i,c,1){
		a[i]++;
		dfs(cur-1, i);
		a[i]--;
	}
}

signed main(){
	int T = ci();
	while( T-- ){
		n = ci(), m = ci();
		//mp.clear();
		tot = 0;
		dfs(n-1,m);
		rep(p,0,n-1){
			rep(i,1,tot) printf("%d ", (ans[i]+p)%m+1); puts("");
		}
		//printf("line %d:\n", __LINE__);
	}
	return 0;
}