#include <bits/stdc++.h>
using ll=long long;
#define rep(i,s,n) for (ll i = (s); i < (n); i++)
using namespace std;
using Graph = vector<vector<ll>>;
ll MOD=998244353;
const ll INF=1e18;

ll dp[20010][35];

int main(){
  rep(i,0,20010){
    rep(j,0,35){
      dp[i][j]=0;
    }
  }
  ll N,M,K;
  cin>>N>>M>>K;
  rep(i,0,35){
    dp[0][i]=1;
  }
  rep(i,1,M){
    rep(j0,0,(1<<N)){
      int bit0[N];
      rep(k,0,N){
        int Div=(1<<k);
        bit0[k]=(j0/Div)%2;
      }
      rep(j1,0,(1<<N)){
        int bit1[N];
        rep(k,0,N){
          int Div=(1<<k);
          bit1[k]=(j1/Div)%2;
        }
        ll cnt=0;
        rep(k,0,N){
          if(bit0[k]==1 && bit1[k]==1){
            cnt++;
          }
        }
        if(cnt>=K){
          dp[i][j1]+=dp[i-1][j0];
          dp[i][j1]%=MOD;
        }
      }
    }
  }
  ll ans=0;
  rep(i,0,(1<<N)){
    ans+=dp[M-1][i];
    ans%=MOD;
  }
  cout<<ans<<endl;
}