#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N,M,K;
ll dp[2020][2020];
ll dp2[2020];
ll dp3[14][2020];
const ll mo=998244353;

ll modpow(ll a, ll n=mo-2) {
	ll r=1;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}

ll comb(ll P_,ll Q_) {
	if(P_<0 || Q_<0 || Q_>P_) return 0;
	ll p=1,q=1;
	Q_=min(Q_,P_-Q_);
	for(int i=1;i<=Q_;i++) p=p*P_%mo, q=q*i%mo,P_--;
	
	return p*modpow(q,mo-2)%mo;
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M>>K;
	dp[0][1]=1;
	dp[0][2]=mo-1;
	FOR(i,2002) {
		ll c=comb(N,i);
		for(x=1;x<=2000;x++) {
			(dp[i][x]+=dp[i][x-1])%=mo;
			dp[i+1][x+1]+=dp[i][x];
			dp[i+1][min(2001,2*x+1)]+=mo-dp[i][x];
			
			(dp2[x-1]+=dp[i][x]*c)%=mo;
		}
	}
	
	
	ll ret=0;
	dp3[0][1]=1;
	FOR(i,13) {
		ll c=comb(K,i);
		for(x=1;x<=M;x++) {
			(ret+=dp3[i][x]*c)%=mo;
			for(y=2;x*y<=M;y++) {
				(dp3[i+1][x*y]+=dp3[i][x]*dp2[y-1])%=mo;
			}
		}
	}
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}