#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 10,mod = 998244353;
int addv(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
int subv(int x,int y){return (x>=y)?(x-y):(x-y+mod);}
void add(int& x,int y){x = addv(x,y);}
void sub(int& x,int y){x = subv(x,y);}
int qpow(int a,int n){
    int res = 1; a%=mod;
    while(n){
        if(n&1)res = 1ll*res*a%mod;
        n>>=1; a = 1ll*a*a%mod;
    }
    return res;
}
int qinv(int a){return qpow(a,mod-2);}


int n,m,k,ans;

int vis[N][N],tr[N],tc[N],r,c,cnt;

int C(int n,int m){
    if(n<m || m<0)return 0;
    int res = 1,fac = 1;
    for(int i=1;i<=m;i++)fac = 1ll*fac*i%mod,res = 1ll*res*(n-i+1)%mod;
    return 1ll*res*qinv(fac)%mod;
}

void dfs(int cur){
    int res = 0; for(int i=1;i<=r;i++)for(int j=1;j<=c;j++)if(!vis[i][j])res = 1;
    if(!res){
        if(cur < k)return;
        int flag = 1; for(int i=1;i<r;i++)flag &= (tr[i]>0); for(int i=1;i<c;i++)flag &= (tc[i]>0);
        cnt += flag;
        return;
        for(int i=1;i<=r;i++){
            for(int j=1;j<=c;j++)cout<<vis[i][j]<<" ";
            cout<<endl;
        }
        cout<<endl;
        return;
    }
    if(cur == k)return;
    for(int i=1;i<=r;i++)for(int j=1;j<=c;j++)if(!vis[i][j]){
        //枚举长和宽
        for(int x=1;x<=r-i+1;x++){
            for(int y=1;y<=c-j+1;y++){
                int flag = 1;
                for(int a=0;a<x;a++)for(int b=0;b<y;b++)flag &= !vis[i+a][j+b];
                if(!flag)continue;
                for(int a=0;a<x;a++)for(int b=0;b<y;b++)vis[i+a][j+b] = cur+1;
                tr[i-1]++; tr[i+x-1]++; tc[j-1]++; tc[j+y-1]++;
                dfs(cur+1);
                for(int a=0;a<x;a++)for(int b=0;b<y;b++)vis[i+a][j+b] = 0;
                tr[i-1]--; tr[i+x-1]--; tc[j-1]--; tc[j+y-1]--;
            }
        }
        return;
    }
}

void calc(int r,int c){
    ::r = r,::c = c;
    memset(vis,0,sizeof vis);
    dfs(0);
}

int main(){
    cin>>n>>m>>k;
    for(int i=1;i<=k;i++)for(int j=1;j<=k;j++){
        cnt = 0;
        calc(i,j);

        add(ans,1ll*cnt*C(n-1,i-1)%mod*C(m-1,j-1)%mod);
    }
    cout<<ans<<endl;

    return 0;
}