#include <bits/stdc++.h>
#include <atcoder/all>
using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;
using namespace atcoder;
using namespace std;

#define rep(i,n) for (int i = 0; i < n; i++)
using ll = long long;
set<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
const int inf =1e9;
const ll infl = 4e18;

template <typename T>
bool chmax(T &a, const T& b) {if (a < b) {a = b;  return true;}return false;
}
template <typename T>
bool chmin(T &a, const T& b) {if (a > b) {a = b;  return true;}return false;}



int main(){
    int N,M,K;
    cin>>N>>M>>K;
    vector<vector<mint>> dp(M,vector<mint>(1<<N,0));
    if (M==1){
        mint ans=1;
        rep(i,N){
            ans*=2;
        }
        cout << ans.val() << endl;
        return 0;
    }
    rep(i,1<<N){
        if (__builtin_popcount(i)>=K) 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 (__builtin_popcount(j&k)>=K){
                    dp[i][j]+=dp[i-1][k];
                }
            }
        }
    }
    mint ans=0;
    rep(i,1<<N) ans+=dp[M-1][i];
    cout << ans.val() << endl;
    return 0;

}