#include<bits/stdc++.h>
#define int  long long
using namespace std;
const int mod=998244353;
int ksm(int a,int p){
	if(p==0)return 1;
	int tmp=ksm(a,p/2);
	if(p&1)return tmp*tmp%mod*a%mod;
	else return tmp*tmp%mod;
}
int fac[1000005],inv[1000005];
int C(int n,int m){
	if(n<m||n<0||m<0)return 0;
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int h,w,K;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	fac[0]=inv[0]=1;
	for(int i=1;i<=500000;i++)fac[i]=fac[i-1]*i%mod,inv[i]=ksm(fac[i],mod-2);
	cin>>h>>w>>K;
	int d=K/2,ans=0;
	for(int m=0;m<=min(h-1,w-1);m++){
		int mink=-1*((m+d+1)/(2*d+2)),maxk=m/(2*d+2);
		int sum=0;
		for(int k=mink;k<=maxk;k++){
			sum+=((C(2*m,m+k*(2*d+2))-C(2*m,m+d+1+k*(2*d+2)))%mod+mod)%mod;
		}
		ans+=C(h+w-2,2*m)*C(h+w-2-2*m,h-1-m)%mod*sum%mod;
		ans%=mod;
	}
	cout<<ans;
}