#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a);i <= (b);++i)
#define per(i, a, b) for(int i = (a);i >= (b);--i)
#define lc (k << 1)
#define rc (k << 1 | 1)
#define lowbit(x) ((x) & -(x))
#define odd(x) ((x) & 1)
#define even(x) (!odd(x))
#define fir first
#define sec second
#define pb push_back
#define il inline
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define i128 __int128
#define f128 __float128
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << "In Line " << __LINE__ << " the " << #x << " = " << (x) << "\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> using vc = vector<T>;
template<class Tx, class Ty>
il void chkmx(Tx& x, const Ty y) {x = max<common_type_t<Tx, Ty>>(x, y);}
template<class Tx, class Ty>
il void chkmn(Tx& x, const Ty y) {x = min<common_type_t<Tx, Ty>>(x, y);}
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3fll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
bool ms;

const int N = 55;
int f[N * 2][N], pre[N * 2][N];

void solve() {
    int n, m, p;
    cin >> n >> m >> p;
    auto toadd = [&](int& x, int y) -> void {
        (x += y) >= p && (x -= p);
    };
    memset(f, 0, sizeof(f));
    f[0][n] = 1;
    rep(i, 0, m - 1) {
        rep(j, 0, min(i, (n - 1) * 2)) {
            memcpy(pre[j + 2], f[j] + 1, sizeof(f[j][0]) * n);
            per(k, n, 1) {
                if(i + 1 <= (n - k + 1) * (n - k) + (k - 1) * (k - 2) / 2 + (k - 1) * (n - k + 1))
                    break;
                f[j][k] = 0;
            }
        }
        int ans = 0;
        rep(j, 0, min(i + 1, (n - 1) * 2)) {
            rep(k, 1, n) {
                if(j <= i + 1) {
                    if(__builtin_expect(j > 0, 1))
                        toadd(pre[j][k], pre[j - 1][k + 1]);
                    toadd(f[j][k], pre[j][k]);
                }
                toadd(ans, f[j][k]);
            }
        }
        cout << ans << " \n"[i == m - 1];
    }
}

bool mt;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cerr << fabs(&ms - &mt) / 1024 / 1024 << "\n";
    int t;
    cin >> t;
    while(t--)
        solve();
    cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
    return 0;
}