#include <bits/stdc++.h>
#define fi first
#define se second
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
using namespace std;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}

const int N = 2e5 + 5;
const int oo = 1e9;
const long long ooo = 1e18;
const int mod = 998244353;

void add(int &a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
}

int bpow(int x, int k) {
    int res = 1;
    for (; k; k >>= 1, x = (long long) x * x % mod)
        if (k & 1) 
            res = (long long) res * x % mod;
    return res;
}



int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);  
    int n,k,m;
    cin >> n >> k >> m;
    vector <int> fac(m + 1), inv(m + 1);
    fac[0] = 1;
    for (int i = 1; i <= m; i++) {
        fac[i] = (long long) fac[i - 1] * i % mod;
    }   
    inv[m] = bpow(fac[m], mod - 2);

    for (int i = m - 1; i >= 0; i--) {
        inv[i] = (long long) inv[i + 1] * (i + 1) % mod;
    }

    auto comb = [&](int k, int n) {
        if (k > n)
            return 0LL;
        return (long long) fac[n] * inv[k] % mod * inv[n - k] % mod;
    };

    vector <int> num(bit(23));
    for (int i = 1; i <= m; i++) 
        num[i] = 1;

    for (int i = 0; i < 23; i++)
    for (int mask = bit(23) - 1; mask >= 0; mask--) {
        if (!getbit(mask, i))
            add(num[mask], num[mask ^ bit(i)]);
    }

    // for (int i = 0; i <= m; i++) {
    //     cerr << i << " " << num[i] << "\n";
    // }


    for (int mask = 0; mask < bit(23); mask++) 
        num[mask] = comb(n, num[mask]); 

    for (int i = 0; i < 23; i++) 
    for (int mask = bit(23) - 1; mask >= 0; mask--) {
        if (!getbit(mask, i)) 
            add(num[mask], mod - num[mask ^ bit(i)]);
    }

    int ans = 0;
    for (int mask = 0; mask < bit(23); mask++) 
        if (__builtin_popcount(mask) >= k)
            add(ans, num[mask]); 

    cout << (long long) ans * fac[n] % mod << "\n";
}