#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
const int mod = 998244353;

void add(int &a, int b){
    a += b;
    if (a >= mod) a -= mod;
}

int mul(int a, int b){
    return 1LL * a * b % mod;
}

int dp[105][105], tmp[105];

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int n, m, d;
    cin >> n >> m >> d;
    dp[d][0] = dp[d][1] = 1;
    for(int i = d - 1; i >= 0; i--){
        dp[i][1] = 1;
        for(int j = 0; j < m; j++){
            memset(tmp, 0, sizeof tmp);
            for(int k = 1; k <= n; k++){
                for(int t = 0; k + t <= n; t++){
                    add(tmp[k + t], mul(dp[i][k], dp[i + 1][t]));
                }
            }
            swap(dp[i], tmp);
        }
        dp[i][0] = 1;
    }
    cout << dp[0][n] << '\n';

}