#include <bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define mp make_pair

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;

const int N = 300500, K = 23, inf = 1e9, mod = 998244353;
const ll INF = 1e18;

int sum(int a, int b) {
    a += b;
    if (a >= mod)
        a -= mod;
    return a;
}

int sub(int a, int b) {
    a -= b;
    if (a < 0)
        a += mod;
    return a;
}

int mult(int a, int b) {
    return 1ll * a * b % mod;
}

int bp(int a, int b) {
    int res = 1;
    while (b) {
        if (b & 1)
            res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}


int n, k, m, ans;
int a[1 << K];

int f[1 << K], rf[1 << K], inv[1 << K];

int C(int n, int k) {
    return (0 <= k && k <= n) ? mult(f[n], mult(rf[k], rf[n - k])) : 0;
}

void solve() {
    f[0] = rf[0] = f[1] = rf[1] = inv[1] = 1;
    for (int i = 2; i < (1 << K); i++) {
        f[i] = mult(i, f[i - 1]);
        inv[i] = mult(inv[mod % i], sub(0, mod / i));
        rf[i] = mult(rf[i - 1], inv[i]);
    }

    cin >> n >> k >> m;
    for (int i = 1; i <= m; i++)
        a[i] = 1;
    for (int j = 0; j < K; j++)
        for (int i = 0; i < (1 << K); i++)
            if ((i >> j) & 1)
                a[i ^ (1 << j)] = sum(a[i ^ (1 << j)], a[i]);
    for (int i = 0; i < (1 << K); i++)
        a[i] = C(a[i], n);
    for (int j = 0; j < K; j++)
        for (int i = 0; i < (1 << K); i++)
            if ((i >> j) & 1)
                a[i ^ (1 << j)] = sub(a[i ^ (1 << j)], a[i]);
    for (int i = 0; i < (1 << K); i++)
        if (__builtin_popcount(i) >= k)
            ans = sum(ans, a[i]);
    ans = mult(ans, f[n]);
    cout << ans << "\n";
}

int main() {
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
//        cout << "Case #" << i << endl;
        solve();
    }
}