#ifndef akinyan
#define akinyan
#include <bits/stdc++.h>
using namespace std;
using ch = char;
using ll = long long;
using ld = long double;
using db = double;
using st = string;
using vdb = vector<db>;
using vvdb = vector<vdb>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<ld>;
using vvd = vector<vd>;
using vs = vector<st>;
using vvs = vector<vs>;
using vc = vector<ch>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
const ll mod = 998244353;
const ll MOD = 1000000007;
const ll INF = 1000000000000000000LL;
using pall = pair<ll,ll>;
using vp = vector<pall>;
#endif

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main(){
    ll N,M,K;
    cin>>N>>M>>K;
    vector DP(M,vector((1 << N),mint(0)));
    for(int i=0; i<(1 << N); i++){
        DP[0][i] = 1;
    }
    for(int i=1; i<M; i++){
        for(int j=0; j<(1 << N); j++){
            for(int k=0; k<(1 << N); k++){
                if(popcount((unsigned int)j & k) >= K){
                    DP[i][k] += DP[i-1][j];
                }
            }
        }
    }
    mint ans = 0;
    for(int i=0; i<(1 << N); i++){
        ans += DP[M-1][i];
    }
    cout << ans.val() << endl;
}