#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MOD = 998244353;

int main() {
    int n, m, d;
    cin >> n >> m >> d;

    vector <vector <LL>> C(n * m + 1, vector <LL> (n + 1));

    for (int i = 0; i <= n * m; i++) {
        C[i][0] = 1;
        for (int j = 1; j <= min(i, n); j++) {
            C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
            // cerr << i << " " << j << " " << C[i][j] << endl;
        }
    }

    vector < vector <LL> > f(n + 1, vector <LL> (n + 1));
    f[1][1] = 1;
    LL ans = 0;
    if (n == 1) ans += 1;
    for (int i = 1; i <= d; i++) {
        vector < vector <LL> > g(n + 1, vector <LL> (n + 1));
        for (int j = 1; j <= n; j++) { // used j nodes
            for (int k = 1; k <= n; k++) { // currently k nodes
                if (f[j][k] == 0) continue;
                for (int l = 1; l <= min(k * m, n - j); l++) {
                    g[j + l][l] = (g[j + l][l] + f[j][k] * C[k * m][l]) % MOD;
                }
            }
        }
        f = move(g);
        for (int j = 1; j <= n; j++) {
            ans = (ans + f[n][j]) % MOD;
        }
    }
    ans %= MOD;
    ans += MOD;
    ans %= MOD;
    cout << ans << endl;
}