#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace atcoder;
using namespace std;
using ll = long long;
using mint = modint998244353;
int main() {
	int N, M, K;cin >> N >> M >> K;
	//M = 2e4;
	vector<mint> dp((1 << N), 1);
	for (int i = 2;i <= M;i++) {
		vector<mint> ndp(1<< N, 0);
		for (int bit = 0;bit < (1 <<N);bit++) for (int bbit = 0;bbit < (1 << N);bbit++) {
			int cnt = 0;
			for (int i = 0;i < N;i++) {
				if (bit & (1 << i) and bbit & (1 << i)) cnt++;
			}
			if (cnt >= K) ndp[bit] += dp[bbit];
		}
		swap(dp, ndp);
	}
	mint ans = 0;
	for (int bit = 0;bit < (1 << N);bit++) ans += dp[bit];
	cout << ans.val() << endl;
}