#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define orange(a...) orange_(#a, a)
#define debug(a...) debug_(#a, a)
template <typename i>
void orange_(const char * s, i l, i r) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; l != r; l++)
        cerr << (f++ ? " " : "") << *l;
    cerr << " ]\e[0m\n";
}
template <typename ...T>
void debug_(const char * s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

const int maxn = 65;
const int mod = 998244353;

int modadd(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b;
}
int modmul(int64_t a, int64_t b) {
    return static_cast<int>(a * b % mod);
}

int inv[maxn], fac[maxn], ifac[maxn];
int C(int n, int k) {
    assert (k >= 0 && k <= n);
    return modmul(fac[n], modmul(ifac[k], ifac[n - k]));
}

int c2(int n) {
    return n * (n - 1) / 2;
}

int dp[maxn][maxn * maxn];

int main() {
    inv[1] = 1;
    for (int i = 2; i < maxn; i++)
        inv[i] = modmul(inv[mod % i], mod - mod / i);

    fac[0] = ifac[0] = 1;
    for (int i = 1; i < maxn; i++) {
        fac[i] = modmul(fac[i - 1], i);
        ifac[i] = modmul(ifac[i - 1], inv[i]);
    }
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, k, t;
    cin >> n >> k >> t;

    dp[0][0] = 1;

    for (int j = 0; j < k; j++) {
        for (int i = n; i >= 1; i--) {
            for (int sz = 1; sz <= i; sz++) {
                const int m = c2(sz) + (j==0 ? sz : 0);
                for (int c = m; c <= t; c++) {
                    dp[i][c] = modadd(
                        dp[i][c],
                        modmul( dp[i - sz][c - m] , C(i, sz) )
                    );
                }
            }
        }
    }

    cout << dp[n][t] << '\n';

    return 0;
}