#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

int main() {
    ll N, M, K;
    cin >> N >> M >> K;

    vector<vector<mint>> dp(M + 1, vector<mint>(1 << N, 0));
    dp[0][(1 << N) - 1] = 1LL;
    for (ll j = 0; j < M; j++) {
        for (ll s = 0; s < (1 << N); s++) {
            for (ll t = 0; t < (1 << N); t++) {
                ll u = s & t;

                ll cnt = 0;
                for (ll i = 0; i < N; i++) {
                    if (u & (1 << i)) {
                        cnt++;
                    }
                }

                if (cnt >= K) {
                    dp[j + 1][t] += dp[j][s];
                }
            }
        }
    }
    mint ans = 0;
    for (ll s = 0; s < (1 << N); s++) {
        ans += dp[M][s];
    }
    cout << ans.val() << endl;

    return 0;
}