#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#define N 500007
#define ll long long
#define p 998244353
using namespace std;

inline int power(int a,int t){
    int res = 1;
    while(t){
        if(t&1) res = (ll)res*a%p;
        a = (ll)a*a%p;
        t >>= 1;
    }
    return res;
}

int inv[N],fac[N],ifac[N];

void init(int n){
    inv[1] = fac[0] = fac[1] = ifac[0] = 1;
    for(int i=2;i<=n;++i) fac[i] = (ll)fac[i-1]*i%p;
    ifac[n] = power(fac[n],p-2);
    for(int i=n-1;i;--i) ifac[i] = (ll)ifac[i+1]*(i+1)%p;
    for(int i=2;i<=n;++i) inv[i] = (ll)fac[i-1]*ifac[i]%p;
}

inline int binom(int n,int m){
    if(n<m) return 0;
    return (ll)fac[n]*ifac[m]%p*ifac[n-m]%p;
}

void solve(int n,int k,int *h){
    h[0] = binom(n,k);
    h[1] = -2*binom(n-1,n-k)%p;
    for(int i=2;i<=n;++i)
        h[i] = -((ll)(i-2)*h[i-2] - (ll)(1-2*k+n)*h[i-1])%p*inv[n+1-i]%p;
    for(int i=1;i<=n;++i) h[i] = (h[i]+h[i-1])%p;
} 

int n,m,k;
int f[N],g[N];

int main(){
    scanf("%d%d%d",&n,&m,&k);
    init(n*m+1);
    int t,bm = 1;
    g[0] = (m&1)?-1:1;
    for(int i=0;i<m;++i) g[i+1] = (ll)g[i]*(i-m)%p*inv[i+1]%p;
    for(int i=0;i<=n;++i){
        for(int j=0;j<=m;++j){
            t = i*j+(n-i)*(m-j);
            f[t] = (f[t] + (ll)bm*g[j])%p;
        }
        bm = (ll)bm*(i-n)%p*inv[i+1]%p;
    }
    solve(n*m,k,g); 
    int ans = 0;
    for(int i=0;i<=n*m;++i) ans = (ans + (ll)f[i]*g[i])%p;
    ans = (ll)ans*power(2,p-n-m-1)%p;
    printf("%d",(ans+p)%p);
    return 0;   
}