#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
#define debug true
#define debug2 false

vector<vector<ll>> power(vector<vector<ll>> b,long long e){
    // Copyright (c) 2023 0214sh7
    // https://github.com/0214sh7/library/
    ll N = b.size();
    vector<vector<ll>> r = b;
    REP(i,N){
        REP(j,N){
            r[i][j] = (i==j?1:0);
        }
    }
    while(e){
        if(e&1){
            // r=(r*b)%MOD;
            vector<vector<ll>> s(N,vector<ll>(N,0));
            REP(i,N){
                REP(j,N){
                    REP(k,N){
                        s[i][j] += (r[i][k]*b[k][j])%MOD;
                        s[i][j] %= MOD;
                    }
                }
            }
            r = s;
        }
        // b=(b*b)%MOD;
        vector<vector<ll>> s(N,vector<ll>(N,0));
        REP(i,N){
            REP(j,N){
                REP(k,N){
                    s[i][j] += (b[i][k]*b[k][j])%MOD;
                    s[i][j] %= MOD;
                }
            }
        }
        b = s;
        e >>=1;
    }
    return r;
}

int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    ll N,M,K;
    cin >> N >> M >> K;
    
    vector<vector<ll>> A(1<<N,vector<ll>(1<<N));

    REP(i,1<<N){
        REP(j,1<<N){
            ll c = 0;
            REP(k,N){
                if((i>>k)%2==1 && (j>>k)%2==1){
                    c++;
                }
            }
            if(c>=K)A[i][j] = 1;
        }
    }

    A = power(A,M-1);

    ll Ans = 0;
    REP(i,1<<N){
        REP(j,1<<N){
            Ans = (Ans+A[i][j])%MOD;
        }
    }
    
    cout << Ans << endl;
    
    return 0;
    
}