#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 5e6 + 5;
const int mod = 998244353;
const int lg = 23; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, k, m;
int f[1 << lg];

int frac[1 << lg], inv[1 << lg];
int pw(int x, int y) {
    int res = 1;
    for (; y; y >>= 1, x = 1LL * x * x % mod)
        if (y & 1)
            res = 1LL * res * x % mod;
    return res;
}
void pre() {
    int n = 5e6;
    frac[0] = 1;
    for (int i = 1; i <= n; ++i) frac[i] = 1LL * frac[i - 1] * i % mod;
    inv[n] = pw(frac[n], mod - 2);
    for (int i = n; i >= 1; --i) inv[i - 1] = 1LL * inv[i] * i % mod;
}
int nCk(int n, int k) {
    return k > n ? 0 : 1LL * frac[n] * inv[k] % mod * inv[n - k] % mod;
}

int MUL(int a, int b) {
    return 1LL * a * b % mod;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    pre();

    cin >> n >> k >> m;

    for (int i = 1; i <= m; ++i) f[i] = 1;

    for (int i = 0; i < lg; ++i) for (int mask = 0; mask < bit(lg); ++mask) if (!getbit(mask, i)) {
        add(f[mask], f[mask ^ bit(i)]);
    }

    for (int mask = 0; mask < bit(lg); ++mask) {
        f[mask] = nCk(f[mask], n);
    }

    for (int i = 0; i < lg; ++i) for (int mask = 0; mask < bit(lg); ++mask) if (!getbit(mask, i)) {
        add(f[mask], -f[mask ^ bit(i)]);
    }

    int res = 0;
    for (int mask = 0; mask <= m; ++mask) if (popcount(mask) >= k) {
        add(res, f[mask]);
    }

    res = MUL(res, frac[n]);
    cout << res;

    return 0;
}

/*

*/