#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define MAXN 105
#define ll long long
const ll mod = 998244353;

int n, m, d;
ll f[MAXN][MAXN], g[MAXN][MAXN], tmp[MAXN][MAXN][2];


int main() {
    cin>>n>>m>>d; d++;
    f[0][0] = 1; g[0][0] = 1;
    for(int i=1;i<=d;i++) {
        memset(tmp, 0, sizeof(tmp));
        tmp[0][0][i==1] = 1;
        for(int j=1;j<=m;j++) {
            for(int k=0;k<n;k++) {
                for(int l=0;l<=k;l++) {
                    if(i >= 2) (tmp[j][k][0] += tmp[j-1][k-l][0] * g[i-2][l]) %= mod;
                    (tmp[j][k][1] += tmp[j-1][k-l][1] * g[i-1][l] + tmp[j-1][k-l][0] * f[i-1][l]) %= mod;
                }
                // printf("tmp[%d][%d] = %lld, %lld\n", j, k, tmp[j][k][0], tmp[j][k][1]);
            }
        }
        for(int j=1;j<=n;j++) f[i][j] = tmp[m][j-1][1], g[i][j] = (g[i-1][j] + f[i][j]) % mod;       
        g[i][0] = 1;
        // for(int j=1;j<=n;j++) {
            // printf("f[%d][%d] = %lld, g[%d][%d] = %lld\n", i, j, f[i][j], i, j, g[i][j]);
        // }
    }
    cout << g[d][n] << '\n';
    return 0;
}