#include<bits/stdc++.h>
using namespace std;using ld=long double;using ll=long long;
using pll=pair<ll,ll>;
const int M=998244353,inv2=(M+1)/2,P=20;const ld eps=1e-8,pi=acos(-1);
ll poww(ll bs,ll x){ll res=1;for(;x;x>>=1,(bs*=bs)%=M)if(x&1)(res*=bs)%=M;return res;}
ll invv(ll bs){return poww(bs,M-2);}
//step lft_node lft_ed
// -x,-x
int mod;
void add(ll&a,ll b){a+=b;if(a>=mod)a-=mod;}
struct S
{
    int n,m,El;vector<vector<ll>>dp;vector<ll>res;
    void ini()
    {
        cin>>n>>m>>mod;El=n*(n-1);n--;res.resize(m+1,0);
        dp.resize(n+1,vector<ll>(El+1,0));dp[n][0]=1;
        for(int i=1;i<=m;i++)
        {
            vector<vector<ll>>dp2(n+1,vector<ll>(El+1,0));
            for(int j=0;j<=n;j++)for(int k=0;k<=El;k++)
            {
                if(dp[j][k])
                {
                    ll v=dp[j][k];
                    add(dp2[j][k+1],v);
                    add(res[i],v);
                }
                if(j==n||k==El)
                {
                    int j2=j,k2=k;ll sum=0;
                    while(1)
                    {
                        add(sum,dp[j2][k2]);
                        j2--;k2--;if(j2<0||k2<0)break;
                        add(dp2[j2][k2],sum);
                        add(res[i],sum);
                    }
                }
            }
            swap(dp,dp2);
            //for(int j=0;j<=n;j++,cout<<'\n')for(int k=0;k<=El;k++)cout<<dp[i][j][k]<<'.';
           /// cout<<"*****\n";
        }
        for(int i=1;i<=m;i++)cout<<res[i]<<" \n"[i==m];
    }
    void solve()
    {

    }
};
signed main()
{
    cout<<fixed<<setprecision(12);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;cin>>t;
    while(t--){S SS;SS.ini();SS.solve();}
}
/*

 */