#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e7+5;
const ll mod=998244353;
ll n,m,k,fac[N],inv[N];
ll C(ll n,ll m){
	if(n<0||m<0||n<m) return 0;
	if(n<N) return(fac[n]*(inv[m]*inv[n-m])%mod)%mod;
	else{
		ll ret=inv[m];
		for(ll i=n;i>=n-m+1;i--)ret=(ret*(i%mod))%mod;
		return ret;
	}
}
ll g(ll n,ll m){//插板 
	if(n<0)return 0;
	return C(n+m-1,m-1);
}
ll f(ll n,ll m,ll k){
	n-=m;
	if(n<0)return 0;
	ll ans=0;
	for(ll i=0;i<=m;i++){
		ll ret=(g(n-i*k,m)*C(m,i))%mod;
		ans=(i%2)?(ans-ret+mod)%mod:(ans+ret)%mod;//容斥
	}
	return ans;
}
int main(){
	cin>>n>>m>>k;
	fac[0]=fac[1]=inv[0]=inv[1]=1;
	for(ll i=2;i<N;i++)fac[i]=(fac[i-1]*i)%mod;
	for(ll i=2;i<N;i++)inv[i]=((mod-mod/i)*inv[mod%i])%mod;
	for(ll i=2;i<N;i++)inv[i]=(inv[i]*inv[i-1])%mod;
	//小于m 
	
	ll ans=0;
	for(ll i=0;i<k;i++)
		ans=(ans+(f(i*m+n%m,k,m-1)*g((n-n%m)/m-i,k))%mod)%mod;
	cout<<ans;
	return 0;
}