#include <bits/stdc++.h>  
using namespace std;  

#define int long long  

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

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

	int n, m, d;
	cin >> n >> m >> d;

	vector C(n * m + 1, vector<int>(n + 1));
	for (int i = 0; i <= n * m; i++) {
		C[i][0] = 1;
	}
	for (int i = 1; i <= n * m; i++) {
		for (int j = 1; j <= min(i, n); j++) {
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
		}
	}

	vector<int> cnt(d + 1);
	cnt[0] = 1;
	for (int i = 1; i <= d; i++) {
		if (cnt[i - 1] > n) {
			cnt[i] = 1e18;
		} else {
			cnt[i] = cnt[i - 1] * m;
		}
	}

	if (n == 1) {
		cout << 1 << "\n";
		return 0;
	}

	int ans = 0;
	vector dp(n + 1, vector<int>(n + 1));
	dp[1][1] = 1;
	for (int l = 1; l <= d; l++) {
		vector ndp(n + 1, vector<int>(n + 1));
		for (int i = l + 1; i <= n; i++) {
			for (int j = 1; j <= min(i, cnt[l]); j++) {
				for (int k = 1; k <= min({i - j, cnt[l - 1], (j + m - 1) / m}); k++) {
					add(ndp[i][j], dp[i - j][k] * C[k * m][j] % mod);
				}
			}
		}
		dp = ndp;
		for (int i = 1; i <= n; i++) {
			add(ans, dp[n][i]);
		}
		cout << "\n";
	}
	cout << ans << "\n";

    return 0;
}