// https://www.youtube.com/watch?v=wthasN45KuY
// You said I’d fly away
// But my walls have kept me down
// Now I’m lost and I’m afraid
// And I’m close to hit the ground
// 
// You said I’d fly away
// You said I’d fly anywhere
// But I keep on Falling

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

namespace modint {

using i64 = int64_t;

template <int P>
struct Mint {
   private:
    constexpr Mint power(Mint x, i64 p) const {
        Mint res = 1;
        while (p > 0) {
            if (p & 1) {
                res *= x;
            }
            x *= x;
            p >>= 1;
        }
        return res;
    }

    constexpr int norm(int x) const {
        if (x < 0) {
            x += getMod();
        }
        if (x >= getMod()) {
            x -= getMod();
        }
        return x;
    }

   public:
    int x;
    constexpr Mint() : x{} {}
    constexpr Mint(i64 x) : x{norm(x % getMod())} {}
    static int mod;
    constexpr static int getMod() {
        if (P > 0) {
            return P;
        } else {
            return mod;
        }
    }
    constexpr static void setMod(int Mod_) { mod = Mod_; }

    constexpr int val() const { return x; }
    explicit constexpr operator int() const { return x; }
    constexpr Mint operator-() const {
        Mint res;
        res.x = norm(getMod() - x);
        return res;
    }
    constexpr Mint inv() const {
        assert(x != 0);
        return power(*this, getMod() - 2);
    }
    constexpr Mint pow(i64 r) const { return power(*this, r); }
    constexpr Mint &operator*=(Mint rhs) & {
        x = 1LL * x * rhs.x % getMod();
        return *this;
    }
    constexpr Mint &operator+=(Mint rhs) & {
        x = norm(x + rhs.x);
        return *this;
    }
    constexpr Mint &operator-=(Mint rhs) & {
        x = norm(x - rhs.x);
        return *this;
    }
    constexpr Mint &operator/=(Mint rhs) & { return *this *= rhs.inv(); }
    friend constexpr Mint operator*(Mint lhs, Mint rhs) {
        Mint res = lhs;
        res *= rhs;
        return res;
    }
    friend constexpr Mint operator+(Mint lhs, Mint rhs) {
        Mint res = lhs;
        res += rhs;
        return res;
    }
    friend constexpr Mint operator-(Mint lhs, Mint rhs) {
        Mint res = lhs;
        res -= rhs;
        return res;
    }
    friend constexpr Mint operator/(Mint lhs, Mint rhs) {
        Mint res = lhs;
        res /= rhs;
        return res;
    }
    friend constexpr std::istream &operator>>(std::istream &is, Mint &a) {
        i64 v;
        is >> v;
        a = Mint(v);
        return is;
    }
    friend constexpr std::ostream &operator<<(std::ostream &os, const Mint &a) {
        return os << a.val();
    }
    friend constexpr bool operator==(Mint lhs, Mint rhs) {
        return lhs.val() == rhs.val();
    }
    friend constexpr bool operator!=(Mint lhs, Mint rhs) {
        return lhs.val() != rhs.val();
    }
};

template <int P>
int Mint<P>::mod{0};

template <typename Z>
struct Comb {
    std::vector<Z> fact, inv_fact;
    Comb(int n) {
        fact.resize(n + 1, Z(1));
        inv_fact.resize(n + 1, Z(1));
        for (int i = 1; i <= n; i++) {
            fact[i] = fact[i - 1] * i;
        }
        inv_fact[n] = Z{1} / fact[n];
        for (int i = n - 1; i >= 0; i--) {
            inv_fact[i] = inv_fact[i + 1] * (i + 1);
        }
    }
    Z get(int n, int m) const {
        if (n < m || m < 0) return 0;
        return fact[n] * inv_fact[m] * inv_fact[n - m];
    }
};
}  // namespace modint

// check the modulus!!!
constexpr int MOD = 998244353;

using Z = modint::Mint<MOD>;
using C = modint::Comb<Z>;

C comb(64 + 114);

#define int i64
constexpr int INF = 1e9 + 7;
void solve() {
    int n, k, t; cin >> n >> k >> t;
    vector dp(k, vector(n + 1, vector<Z>(t + 1, 0)));
    for (int i = 0; i <= n; i++) {
        if (i * (i + 1) / 2 <= t) dp[0][i][i * (i + 1) / 2] = comb.get(n, i);
    }
    for (int i = 1; i < k; i++) {
        for (int c = 0; c <= n; c++) {
            for (int d = 0; c + d <= n; d++) {
                for (int p = 0; p <= t; p++) {
                    int np = p + d * (d - 1) / 2;
                    if (np <= t) {
                        dp[i][c + d][np] += dp[i - 1][c][p] * comb.get(n - c, d);
                    }
                }
            }
        }
    }
    cout << dp[k - 1][n][t] << "\n";
}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}