#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef vector<int> vi;
typedef vector< vector <int> > vvi;
typedef pair<int, int> pii;
typedef pair < pair < int, int >, int > piii;
typedef pair < pair <int, int > , pair <int, int> > piiii;
typedef pair<ll, ll> pll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
 
#define FOR(i,a,b) for(int i = a; i < b; i ++)
#define RFOR(i,a,b) for(int i = a-1; i >= b; i --)
#define all(a) a.begin(), a.end()
#define endl '\n';
#define sz(x) (int)(x).size()
 
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
 
template <typename T>
void pr(vector<T> &v) {
    FOR(i, 0, sz(v)) cout << v[i] << " ";
    cout << endl;
}
template <typename T>
void pr(vector<vector<T> > &v) {
    FOR(i, 0, sz(v)) { pr(v[i]); }
}
template <typename T>
void re(T &x) {
    cin >> x;
}
template <typename T>
void re(vector<T> &a) {
    FOR(i, 0, sz(a)) re(a[i]);
}
template <class Arg, class... Args>
void re(Arg &first, Args &... rest) {
    re(first);
    re(rest...);
}
template <typename T>
void pr(T x) {
    cout << x << endl;
}
template <class Arg, class... Args>
void pr(const Arg &first, const Args &... rest) {
    cout << first << " ";
    pr(rest...);
    cout << endl;
}
void ps() { cout << endl; }
template<class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
    cout << t; if (sizeof...(ts)) cout << " "; ps(ts...);
}
 
const ll MOD  =  998244353;
#define inf 1e18;
#define INF INT_MAX;

long double PI = 4*atan(1);
long double eps = 1e-12;

template<int MOD, int RT> struct mint {
	static const int mod = MOD;
	static constexpr mint rt() { return RT; } // primitive root for FFT

	int v; explicit operator int() const { return v; } // explicit -> don't silently convert to int

	mint():v(0) {}

	mint(ll _v) { v = int((-MOD < _v && _v < MOD) ? _v : _v % MOD);
		if (v < 0) v += MOD; }

	bool operator==(const mint& o) const {
		return v == o.v; }
	friend bool operator!=(const mint& a, const mint& b) { 
		return !(a == b); }
	friend bool operator<(const mint& a, const mint& b) { 
		return a.v < b.v; }
	// friend void re(mint& a) { ll x; re(x); a = mint(x); }
	// friend str ts(mint a) { return ts(a.v); }
   
	mint& operator+=(const mint& o) { 
		if ((v += o.v) >= MOD) v -= MOD; 
		return *this; }
	mint& operator-=(const mint& o) { 
		if ((v -= o.v) < 0) v += MOD; 
		return *this; }
	mint& operator*=(const mint& o) { 
		v = int((ll)v*o.v%MOD); return *this; }
	mint& operator/=(const mint& o) { return (*this) *= inv(o); }
	friend mint mpow(mint a, ll p) {
		mint ans = 1; //assert(p >= 0);
		for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans; }
	friend mint inv(const mint& a) { //assert(a.v != 0); 
		return mpow(a,MOD-2); }
		
	mint operator-() const { return mint(-v); }
	mint& operator++() { return *this += 1; }
	mint& operator--() { return *this -= 1; }
	friend mint operator+(mint a, const mint& b) { return a += b; }
	friend mint operator-(mint a, const mint& b) { return a -= b; }
	friend mint operator*(mint a, const mint& b) { return a *= b; }
	friend mint operator/(mint a, const mint& b) { return a /= b; }
};

using mi = mint<MOD,5>; // 5 is primitive root for both common mods
int n,m,k;

vvi cnt(24);
mi fact[6000010] = {};
mi invf[6000010] = {};

mi choose(int a, int b) {
    if(b < 0 || b > a) return 0;
    return fact[a] * invf[b] * invf[a-b];
}


mi calc(int kv) {
    mi tot = 0;
    for(auto x : cnt[kv]) {
        if(x > m) continue;

  //      cout << "x: " << x << endl;
        vi other;
        FOR(i,0,24) {
            if(((1 << i) & x) == 0) other.pb(1 << i);
        }

        int rem = m - x;
        int numg = 0;
   //     cout << rem << endl;
        RFOR(i,other.size(),0) {
            if(rem >= other[i]) {
       //         cout << "i: " << i << endl;
                numg += (1 << i);
                rem -= other[i];
        //        cout << rem << endl;
            }
        }
        numg++;
//        cout << "numg: " << numg << endl;

        tot += choose(numg, n);
    }
    return tot * fact[n];
}


int main() {
    //auto start = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);cin.tie(0);
    // ofstream cout("disrupt.out");
    // ifstream cin("disrupt.in");
    #ifdef DEBUG
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    #endif 

     cin >> n >> k >> m;

    fact[0] = 1;
    FOR(i,1,6000010) {
        fact[i] = fact[i-1] * i;
    }
    invf[6000009] = inv(fact[6000009]);

    RFOR(i,6000009, 0) {
        invf[i] = (i+1) * invf[i+1];
    }


    FOR(i,0,(1<<23)) {
        int c = 0;
        FOR(j,0,23) {
            if((1 << j) & i) c++;
        }
        cnt[c].pb(i);
    }

    vector<mi> coefs = {};
    mi ans = 0;

    FOR(kv,k,24) {
        mi tot = calc(kv);
      //  cout << kv << " " << tot.v << endl;
        mi curr = 0;
        FOR(i,0,coefs.size()) {
            curr += coefs[i] * choose(kv, k+i);
        }
        mi newcoef = 1 - curr;
        coefs.pb(newcoef);
        ans += newcoef * tot;
    }
    // for(auto x : coefs) {
    //     cout << x.v << " ";
    // }
    // cout << endl;

    cout << ans.v << endl;




    // auto stop = chrono::high_resolution_clock::now();
    // auto duration = chrono::duration_cast<chrono::microseconds>(stop - start);
    // cout << duration.count() << endl;
    //cin.close();
    //cout.close();
}