#include <bits/stdc++.h>

using namespace std;

const int mod = 998244353;
const int N = 110;
int f[N][N];
int n, m, d;

int add(int x, int y) {
    return x + y >= mod ? x + y - mod : x + y;
}

int main() {
    scanf("%d%d%d", &n, &m, &d);
    f[0][0] = 1;
    for (int i = 1; i <= d + 1; ++i) {
        f[i][1] = 1;
        for (int j = 1; j <= m; ++j) {
            for (int k = n; k; --k) {
                f[i][k] = 1ll * f[i][k] * f[i - 1][0] % mod;
                for (int p = 1; p <= k; ++p) {
                    f[i][k] = add(f[i][k], 1ll * f[i - 1][p] * f[i][k - p] % mod);
                }
            }
        }
        f[i][0] = 1;
    }
    // cerr << f[1][2] << ' ' << f[1][1] << '\n';
    printf("%d\n", f[d + 1][n]);
    return 0;
}