#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod = 998244353;

vector<ll> fac(5000001, 0), ifac(5000001, 0), inv(5000001, 0);

ll perm(int n, int k){
    return fac[n] * ifac[n-k] % mod;
}

int main(){
    cin.tie(NULL)->sync_with_stdio(false);

    fac[0] = fac[1] = 1;
    ifac[0] = ifac[1] = 1;
    inv[0] = inv[1] = 1;

    for(ll i = 2; i <= 5000000; i++){
        inv[i] = mod - (mod/i) * inv[mod%i] % mod;

        fac[i] = i * fac[i-1] % mod;        
        ifac[i] = inv[i] * ifac[i-1] % mod;
    }

    int n, k, m;
    cin >> n >> k >> m;

    ll ans = 0;
    int ml = 0;

    while((1<<ml) <= m)
        ml++;

    for(int i = 0; i <= m; i++){
        if(__builtin_popcount(i) >= k){
            vector<vector<ll>> dp(ml, vector<ll>(3, 0));

            dp[ml-1][2] = 1;

            if((i & (1<<(ml-1))) == 0)
                dp[ml-1][0] = 1;
            
            for(int j = ml-2; j >= 0; j--){
                if(m & (1<<j)){
                    dp[j][2] = dp[j+1][2];
                    dp[j][1] = dp[j+1][0] + dp[j+1][1];

                    if((i & (1<<j)) == 0){
                        dp[j][0] = dp[j+1][0] + dp[j+1][1] + dp[j+1][2];
                    }
                }else{
                    dp[j][1] = dp[j+1][0] + dp[j+1][1];

                    if((i & (1<<j)) == 0){
                        dp[j][2] = dp[j+1][2];
                        dp[j][0] = dp[j+1][0] + dp[j+1][1];
                    }
                }
            }

            int mx = dp[0][0] + dp[0][1] + dp[0][2];

            assert(mx <= 5000000);
            
            if(mx >= n){
                if((__builtin_popcount(i) - k) & 1)
                    ans -= perm(mx, n);
                else
                    ans += perm(mx, n);
                
                ans %= mod;

                if(ans < 0)
                    ans += mod;
            }            
        }
    }

    cout << ans << "\n";
}