#include<bits/stdc++.h>
using std::cin;
using std::cout;
using namespace std::ranges;
using u64 = unsigned long long;
const int N = 100;
const int mod = 998244353;
// std::map<std::vector<int>, int> dp[N][N * N];
int dp[N][N * N];
int g[N][N * N];
int fac[N], ifac[N], inv[N];
int n, k, t;
void add(int & x, int y) {
	if((x += y) >= mod) {
		x -= mod;
	}
}
void fam(int & x, int y, int z) {
	x = (x + (u64) y * z) % mod;
}
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	*fac = *ifac = fac[1] = ifac[1] = inv[1] = 1;
	for(int i = 2;i < N;++i) {
		inv[i] = u64(mod - mod / i) * inv[mod % i] % mod;
		fac[i] = (u64) fac[i - 1] * i % mod;
		ifac[i] = (u64) ifac[i - 1] * inv[i] % mod;
	}
	cin >> n >> k >> t;
	for(int i = 0;i <= n;++i) {
		dp[i][i * (i + 1) / 2] = ifac[i];
	}
	for(int i = 1;i < k;++i) {
		for(int j = 0;j <= n;++j) {
			for(int k = 0;k <= j * (j + 1) / 2;++k) {
				for(int l = 0;l + j <= n;++l) {
					fam(g[j + l][k + l * (l - 1) / 2], dp[j][k], ifac[l]);
				}
			}
		}
		std::swap(dp, g);
		memset(g, 0, sizeof(g));
	}
	cout << (u64) dp[n][t] * fac[n] % mod << '\n';
	return 0;
}