#include<bits/stdc++.h>
using namespace std;
constexpr int mod=998244353;
int n,m,k,ans,cn[9],cm[9],inv[9],cntx[9],cnty[9],a[9][9],mp[9][9];
int calc(int N,int M){ int cnt=0;
	auto dfs=[&](auto self,auto x,auto y,auto num){
		if (x>N){ if (num) return;
			for (int i=1;i<=N;i++) 
				if (!cntx[i]) return;
			for (int i=1;i<=M;i++)
				if (!cnty[i]) return;
			return cnt++,void();
		}
		if (a[x][y]) return self(self,y==M?x+1:x,y==M?1:y+1,num);
		for (int i=x;i<=N;i++)
			for (int j=y;j<=M;j++){ bool flag=0;
				for (int k=x;k<=i;k++)
					if (a[k][j]) {flag=1;break;}
				if (flag) break;
				for (int r=x;r<=i;r++)
					for (int c=y;c<=j;c++)
						a[r][c]=1;
				cntx[i]++;cnty[j]++;
				self(self,y==M?x+1:x,y==M?1:y+1,num-1);
				cntx[i]--;cnty[j]--;
				for (int r=x;r<=i;r++)
					for (int c=y;c<=j;c++)
						a[r][c]=0;
			}
	};
	dfs(dfs,1,1,k);
	return cnt;
}
int main(){
	scanf("%d%d%d",&n,&m,&k);n--;m--;inv[1]=1;
	for (int i=2;i<=k;i++) inv[i]=1ll*inv[mod%i]*(mod-mod/i)%mod;
	cn[0]=1;for (int i=1;i<=k;i++) cn[i]=1ll*cn[i-1]*(n-i+1)%mod*inv[i]%mod;
	cm[0]=1;for (int i=1;i<=k;i++) cm[i]=1ll*cm[i-1]*(m-i+1)%mod*inv[i]%mod;
	for (int i=1;i<=k;i++)
		for (int j=i;j<=k;j++)
			if (i*j>=k&&i+j-1<=k)
				mp[i][j]=mp[j][i]=calc(i,j);
	for (int i=1;i<=k;i++)
		for (int j=1;j<=k;j++) if (i*j>=k&&i+j-1<=k)
			ans=(ans+1ll*cn[i-1]*cm[j-1]%mod*mp[i][j])%mod;
	printf("%d\n",ans);
	return 0;
}