///Enta etfsh5t nseet el rank

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
        tree_order_statistics_node_update>;
#define pb push_back
#define F first
#define S second
#define f(i, a, b) for (int i = a; i < b; i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
//#define mp(x, y) make_pair(x, y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ull = unsigned long long;
using uint = uint32_t;
using ii = pair<int, int>;

const int N = 5e6 + 20, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);

const long double EPS = 1e-9;

ll F[N], iF[N];

ll fast(ll b, ll e) {
    int res = 1;
    for (; e; e >>= 1, b = b * b % MOD)
        if (e & 1)
            res = res * b % MOD;
    return res;
}

void init() {
    F[0] = 1;
    f(i, 1, N)F[i] = F[i - 1] * i % MOD;
    iF[N - 1] = fast(F[N - 1], MOD - 2);
    for (int i = N - 2; i >= 0; --i)
        iF[i] = iF[i + 1] * (i + 1) % MOD;
}

int C(int n, int k) {
    if (k > n || k < 0)
        return 0;
    return iF[k] * F[n] % MOD * iF[n - k] % MOD;
}

void doWork() {
    int n, k, m;
    cin >> n >> k >> m;
    int ans = 0;
    for (int mask = m; mask >= 0; --mask) {
        int bits = popCnt(mask);
        if (bits < k) continue;
        int cnt = 0;
        for (int x = 24, cur = bits; x >= cur; --x) {
            if ((m + 1) >> x & 1) {
                if (mask >> x & 1) cur -= 1;
                else cnt += (1 << (x - cur));
            } else {
                if (mask >> x & 1)break;
            }
        }
        int Choose = C(cnt, n);
        for (int cur = bits; cur >= k; --cur) {
            ans = (ans + MOD + ((bits & 1) == (cur & 1) ? +1 : -1) * C(bits, cur) * Choose % MOD) % MOD;
        }
    }
    cout << ans * F[n] % MOD << '\n';

}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE
    init();
    int t = 1;
//    cin >> t;
    while (t--)
        doWork();
    return 0;
}