#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
lld MOD;
const int mx=55;
lld DP[mx*mx][mx][mx];
void solve(){
	int n,m;
	//~ n=50;
	//~ m=n*(n-1);
	//~ MOD=1e9+7;
	cin>>n>>m>>MOD;
	rep(i,0,m+1){
		rep(j,0,n+1){
			rep(k,0,n+1){
				DP[i][j][k]=0;
			}
		}
	}
	DP[0][n][1]=1;
	rep(i,0,m){
		rep(j,0,n+1){
			rep(k,0,n+1){
				DP[i][j][k]%=MOD;
				DP[i+1][j][min(n,k+1)]+=DP[i][j][k];
				rep(l,1,j){
					if(k-(j-l)>0)DP[i+1][l][k-(j-l)]+=DP[i][j][k];
				}
			}
		}
	}
	rep(i,1,m+1){
		lld ans=0;
		rep(j,0,n+1){
			rep(k,0,n+1){
				ans+=DP[i][j][k];
				ans%=MOD;
			}
		}
		cout<<ans<<" ";
	}cout<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	cin>>tt;
	while(tt--){
		solve();
	}
}