#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

ll MOD = 998244353;

ll* inv;
ll* fact;

ll nCr(ll n, ll r) {
    if (r > n || r < 0) return 0;
    return (n == r || r == 0) ? 1 : fact[n] * inv[n-r] % MOD * inv[r] % MOD;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int n, k, m;
    cin >> n >> k >> m;
    
    inv = new ll[m] - 1; inv[1] = 1;
    rep(i,2,m+1) inv[i] = MOD - (MOD / i) * inv[MOD % i] % MOD;
    rep(i,2,m+1) inv[i] = (inv[i-1] * inv[i]) % MOD;
    fact = new ll[m] - 1; fact[1] = 1;
    rep(i,2,m+1) fact[i] = (fact[i-1] * i) % MOD;


    int totbit = 1;
    int mxbit = 1;
    while ((mxbit << 1) <= m) mxbit <<= 1, totbit++;
    int xorv = (1<<totbit)-1;
    vector<ll> dp(1 << totbit, 0);
    dp[xorv] = nCr(m, n);
    for (int i = 1; i < m; i++) {
        int bits = 0;
        ll occEq = 1, occBel = 0;
        int j = mxbit;
        while (j) {
            if (j & m) {
                if (j & i) {
                    bits++;
                    // occEq = occEq
                    // occBel = occBel
                } else {
                    // occEq = occEq
                    occBel = (2 * occBel + occEq) % MOD;
                }
            } else {
                if (j & i) {
                    bits++;
                    occEq = 0;
                    // occBel = occBel
                } else {
                    // occEq = occEq
                    occBel = (2 * occBel) % MOD;
                }
            }
            j >>= 1;
        }
        occBel += occEq;
        if (occBel >= n) {
            ll options = nCr(occBel, n);
            dp[i^xorv] = options;
        }
    }
    rep(b,0,totbit) for(int i=(1<<totbit)-1; i >= 0; i--) if (i & 1 << b) dp[i] = (dp[i] - dp[i^(1 << b)] + MOD) % MOD;
    
    ll res = 0;
    rep(i,0,1<<totbit) if (__builtin_popcount(i) >= k) res = (dp[i^xorv] + res) % MOD;
    res = (res * fact[n]) % MOD;
    cout << res << "\n";
}