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

#define int long long
const int M = 998244353;

long long modpow(long long n, long long k, long long MOD) {
	long long ans = 1;
	while (k > 0) {
		if (k & 1) ans = (ans*n) % MOD;
		n = (n*n) % MOD; k >>= 1;
	}
	return ans;
}

const int MAX = 5001;

long long ft[MAX];
long long ftinv[MAX];

void init() {
	ft[0] = 1;
	for (int i = 1; i < MAX; i++) {
		ft[i] = (ft[i-1]*i) % M;
	}
	ftinv[MAX - 1] = modpow(ft[MAX - 1], M-2, M);

	for (int i = MAX - 2; i >= 0; i--) {
		ftinv[i] = (ftinv[i+1]*(i+1)) % M;
	}
}

long long nCk(int n, int k) {
	if (k < 0 || k > n) return 0;
	if (k == 0 || k == n) return 1;
	return ft[n] * (ftinv[k] * ftinv[n-k] % M) % M; 
}

int n, k, t, ans;

set<vector<int>> stv;

void generate(int id, int nleft, int tleft, vector<int> cz) {
	if (id == -1) {
		for (int i = 1; i <= nleft; i++) {
			if (tleft >= i*(i-1)/2) {
				cz.push_back(i);
				generate(nleft, nleft-i, tleft - i*(i-1)/2, cz);
				cz.pop_back();
			}
		}
		return;
	}
	if (tleft == 0) {
		for (int i = 0; i < nleft; i++) {
			cz.push_back(1);
		}
		stv.insert(cz);
		return;
	}
	if (id == 1) {
		return;
	}

	int sf = id*(id-1)/2;
	while (1) {
		generate(id-1, nleft, tleft, cz);
		nleft -= id; tleft -= sf; cz.push_back(id);
		if (nleft < 0 || tleft < 0) break;
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	init();
	
	cin >> n >> k >> t;
	vector<int> cz;
	generate(-1, n+1, t, cz);

	for (auto v: stv) {
		int wae = 1; int cz = k-1;
		for (int i = 1; i < v.size();) {
			int j = i;
			while (j < v.size() && v[i] == v[j]) {
				j++;
			}
			wae = (wae*nCk(cz, j-i)) % M;
			cz -= j-i; 
			i = j;
		}

		int tmp = nCk(n, v[0]-1), slots = n-(v[0]-1);
		for (int i = 1; i < v.size(); i++) {
			tmp = (tmp*nCk(slots, v[i])) % M;
			slots -= v[i];
		}
		tmp = (tmp*wae) % M;
		ans = (ans + tmp) % M;

		//for (int i: v) cout << i << ' ';
		//	cout << '\n';
		//	cout << tmp << '\n';
	}
	cout << ans << '\n';

	return 0;
}