#include "bits/stdc++.h" /* #include "boost/multiprecision/cpp_int.hpp" namespace mp = boost::multiprecision; using i128=mp::cpp_int; */ using namespace std; typedef long long ll; typedef int64_t i64; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<vvi> vvvi; typedef vector<ll> vll; typedef vector<vll> vvll; typedef vector<vvll> vvvll; typedef vector<string> vs; typedef vector<char> vc; typedef vector<vc> vvc; typedef vector<double> vd; typedef vector<vd> vvd; #define rep(i,a,n) for(int i=a;i<n;i++) #define drep(i,a,n) for(int i=a;i>n;i--) #define yes(ans) if(ans)cout<<"yes"<<endl;else cout<<"no"<<endl; #define Yes(ans) if(ans)cout<<"Yes"<<endl;else cout<<"No"<<endl; #define YES(ans) if(ans)cout<<"YES"<<endl;else cout<<"NO"<<endl; #define iINF 1000000007 #define lINF 10000000000007 #define llINF 4000000000000000007 #define all(x) x.begin(),x.end() #define so(x) sort(all(x)) #define re(x) reverse(all(x)) const double PI = acos(-1); //累乗余り ll modexpo(ll x,ll n,ll m){ if(x==0) return 0; x%=m; ll ans=1; ll change=x; while(n>0){ if(n%2==1){ans*=change; ans%=m;} change*=change; change%=m; n/=2; } return ans; } int main(){ vll ex(10); ex[0]=1; rep(i,1,10) ex[i]=ex[i-1]*2; const ll mod=998244353; ll n,m,K; cin>>n>>m>>K; if(m==1){ cout<<ex[n]<<endl; return 0; } ll N=ex[n]; vvll dp(m,vll(N)); rep(i,0,N) dp[0][i]=1; rep(i,1,m){ rep(j,0,N){ rep(k,0,N){ ll cnt=0; rep(l,0,n){ if((j&k)&ex[l]) cnt++; } //cout<<cnt<<" "; if(cnt>=K) dp[i][j]+=dp[i-1][k]; dp[i][j]%=mod; } /*cout<<endl; cout<<dp[i][j]<<" "; cout<<endl;*/ } //cout<<endl; } /*rep(i,0,m){ rep(j,0,N) cout<<dp[i][j]<<" "; cout<<endl; }*/ ll ans=0; rep(i,0,N) ans+=dp[m-1][i]; ans%=mod; cout<<ans<<endl; }