#include<bits/stdc++.h>
#define ll long long
#define inf 1e9
#define rep(i,l,r) for(register int i=l;i<=r;++i)
#define per(i,r,l) for(register int i=r;i>=l;--i)
using namespace std;
const int N=1e5+10,Mod=998244353;

ll n,m,k;
ll jc[N],jc_inv[N];
ll ans,lim;
inline ll ksm(ll a,ll b){
	ll ret=1;
	while (b){
		if(b&1)ret=ret*a%Mod;
		a=a*a%Mod;
		b>>=1;
	}
	return ret%Mod;
} 
inline void init(){
	jc[0]=jc_inv[0]=1;
	rep(i,1,100000){
		jc[i]=jc[i-1]*i%Mod;
		jc_inv[i]=ksm(jc[i],Mod-2);
	}
	//rep(i,1,10)cout<<jc_inv[i]<<' ';cout<<endl;
}
inline ll C(ll n,ll m){
	if(n<0||m<0||n<m)return 0;
	if(n<=1e5)return jc[n]*jc_inv[m]%Mod*jc_inv[n-m]%Mod;
	else{
		ll ret=jc_inv[m];
		rep(i,n-m+1,n)ret=ret*i%Mod;
		return ret;
	}
}
inline ll g(ll n,ll m){
	if(n<0)return 0;
	return C(n+m-1,m-1);
}
inline ll f(ll n,ll m,ll k){
	n-=m;
	if(n<0)return 0;
	ll ret=0;
	rep(i,0,m){
		ll w=(i&1)?-1:1;
		ret=(ret+w*g(n-i*k,m)*C(m,i)%Mod)%Mod;
		ret=(ret+Mod)%Mod;
	}
	return ret;
}
int main(){
	init();
	scanf("%lld%lld%lld",&n,&m,&k);
	lim=n%m;
	rep(i,0,k-1)ans=(ans+f(i*m+lim,k,m-1)*g((n-lim)/m-i,k)%Mod)%Mod;
	printf("%lld\n",ans);
	return 0;
}