#include<bits/stdc++.h>
using i64 = long long;
using pii = std::pair<int,int>;
const int N = 105, mod = 998244353;
int n, m, d, f[N][N][N], g[N][N], c[N][N];
signed main() {
    scanf("%d%d%d", &n, &m, &d);
    for(int i = 0; i <= m; ++i) c[i][0] = c[i][i] = 1;
    for(int i = 1; i <= m; ++i)
        for(int j = 1; j <= m; ++j)
            c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
    g[0][0] = 1;
    for(int i = 1; i <= n; ++i)
        for(int j = 0; j <= n; ++j)
            for(int k = 0; k <= std::min(m, j); ++k)
                g[i][j] = (g[i][j] + 1ll * g[i - 1][j - k] * c[m][k] % mod) % mod;
    f[0][1][1] = 1;
    for(int i = 1; i <= d; ++i)
        for(int j = 1; j <= n; ++j)
            for(int k = 1; k <= j; ++k)
                for(int t = 1; t <= j - k; ++t)
                    f[i][j][k] = (f[i][j][k] + 1ll * f[i - 1][j - k][t] * g[t][k] % mod) % mod;
    int ans = 0;
    for(int i = 1; i <= d; ++i)
        for(int j = 1; j <= n; ++j)
            ans += f[i][n][j], ans %= mod;
    printf("%d\n", ans);
    return 0;
}