#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
template<class T> using graph=vector<vector<T>>;
template<class T> using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
constexpr int INF32=INT_MAX/2;
constexpr ll INF64=1LL<<60;
constexpr array<int,4> DX4={0,1,0,-1};
constexpr array<int,4> DY4={-1,0,1,0};
constexpr array<int,8> DX8={0,1,1,1,0,-1,-1,-1};
constexpr array<int,8> DY8={-1,-1,0,1,1,1,0,-1};
inline int popcnt(ll n){return __builtin_popcountll(n);}
template<class T> inline bool chmax(T& a,const T& b){return a<b?a=b,true:false;}
template<class T> inline bool chmin(T& a,const T& b){return b<a?a=b,true:false;}
#define rep(i,s,n) for(ll i=(ll)(s);i<(ll)(n);i++)
#define rrep(i,s,n) for(ll i=(ll)(s);i>=(ll)(n);i--)
void _main();
int main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout<<fixed<<setprecision(16);
	_main();
}

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

template<class T>
class Combination{
	private:
		vector<T> fac, ifac;

	public:
		Combination():Combination(0){}
		Combination(int _n):
			fac(_n+1,1),ifac(_n+1,1){
				for(int i=0; i<_n; i++) fac[i+1] = fac[i]*(i+1);
				ifac[_n] = 1/fac[_n];
				for(int i=_n; i>0; i--) ifac[i-1] = ifac[i]*i;
			}

		T p(int a, int b){ 
			if(b<0 || a<b) return 0;
			return fac[a]*ifac[a-b];
		}

		T c(int a, int b){
			if(b<0 || a<b) return 0;
			return p(a,b)*ifac[b];
		}

		T h(int a, int b){
			if(a==0 && b==0) return 1;
			if(a<=0 || b<0) return 0;
			return c(a+b-1, b);
		}
};

void _main(){
	int N, M, K; cin >> N >> M >> K;

	vector dp(M+1, vector<mint>(1U<<N));
	for(unsigned s=0; s<(1U<<N); s++){
		if(K<=popcnt(s)) dp[0][s] = mint(1);
	}
	rep(i,0,M){
		for(unsigned s=0; s<(1U<<N); s++) if(K<=popcnt(s)){
			for(unsigned ns=0; ns<(1U<<N); ns++) if(K<=popcnt(ns&s)){
				dp[i+1][ns] += dp[i][s];
			}
		}
	}

	mint ans = 0;
	for(unsigned s=0; s<(1U<<N); s++){
		if(K<=popcnt(s)) ans += dp[M-1][s];
	}
	cout << ans.val() << endl;
}