#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=4e4,S=8e4;
const int mod=998244353;
int n,m,k;
int f[S+5],g[S+5];
int c[N+5];
int ans;
int main(){
	scanf("%d %d %d",&n,&m,&k);
	f[0]=1;
	int ms=2*m-(k>0),tmp=1;
	for(int i=1;i<=n;i++){
		int r=min(i,n-i)*m;
		ll s=0;
		for(int j=-m;j<m;j++) s+=f[abs(j)];
		for(int j=0;j<=r;j++){
			s+=f[j+m];
			if(k) g[j]=(s-f[j+k]-f[abs(j-k)])%mod;
			else g[j]=(s-f[j])%mod;
			s-=f[abs(j-m)];
		}
		memcpy(f,g,(r+1)*sizeof(int));
		tmp=1ll*tmp*ms%mod;
		int c=499122177ll*(tmp-f[0])%mod;
		ans=(1ll*ans*ms+1ll*c*(n-i+1))%mod;
	}
	printf("%d\n",(ans+mod)%mod);
	return 0;
}