#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;
}

ll fac[1003];
void init_fac(int n){
	fac[0] = 1;
	rep(i,1,n) fac[i]=fac[i-1]*i;
}

int n, m;

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

map<ll,int>mp;

void dfs(int cur, int c){
	if( cur==0 ){
		ll cnt = fac[n-1];
		a[n] = 0;
		int last = 0;
		rep(i,1,n-1){
			if( a[i]!=a[i+1] ){
				cnt /= fac[i-last];
				last = i;
			}
		}
		ans[++tot] = mp[cnt];
	//rep(i,1,n-1) printf("%lld ", a[i]); puts("");
	//	printf("line %d: cnt %d %d\n", __LINE__, cnt, mp[cnt]);
		mp[cnt] = (mp[cnt]+1)%m;
		return;
	}
	rev_rep(i,c,1){
		a[cur] = i;
		dfs(cur-1, i);
	}
}

int main(){
	int T = ci();
	while( T-- ){
		n = ci(), m = ci();
		init_fac(n);
		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;
}