#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
using mint=modint998244353;
mint f[2000010], invf[2000010];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i;
    invf[n]=f[n].inv();
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1);
}
mint comb(int x, int y){
    if(!(0<=y && y<=x)) return 0;
    return f[x]*invf[y]*invf[x-y];
}
int n, m, k;

int main()
{
    cin>>n>>m>>k;
    fac(1000000);
    mint ans=0;
    auto calc=[&](int n, int m, int k){
        return comb(n, k)*f[m]*invf[m-k];
    };
    ans+=n*comb(m, 3)*calc(n-1, m-3, k-3);
    ans+=m*comb(n, 3)*calc(m-1, n-3, k-3);

    if(k-2>=2)ans+=comb(n, 2)*comb(m, 2)*comb(m-2, 2)*calc(n-2, m-4, k-4);
    if(k-2>=2)ans+=comb(m, 2)*comb(n, 2)*comb(n-2, 2)*calc(m-2, n-4, k-4);

    if(k-2>=2)ans+=n*comb(m, 2)*(m-2)*comb(n-1, 2)*calc(n-3, m-3, k-4);

    if(k-2>=2)ans+=comb(n, 2)*comb(m, 3)*2*3*calc(n-2, m-3, k-4);
    if(k-2>=2)ans+=comb(m, 2)*comb(n, 3)*2*3*calc(m-2, n-3, k-4);

    if(k-2>=3)ans+=comb(n, 2)*comb(m, 2)*2*2*(n-2)*comb(m-2, 2)*calc(n-3, m-4, k-5);
    if(k-2>=3)ans+=comb(n, 2)*comb(m, 2)*2*2*(m-2)*comb(n-2, 2)*calc(m-3, n-4, k-5);

    if(k-2>=2)ans+=comb(n, 2)*comb(m, 3)*2*3*calc(n-2, m-3, k-4);
    if(k-2>=2)ans+=comb(m, 2)*comb(n, 3)*2*3*calc(m-2, n-3, k-4);

    if(k-2>=4)ans+=comb(n, 2)*comb(n-2, 2)*comb(m, 2)*comb(m-2, 2)*8*calc(n-4, m-4, k-6);

    if(k-2>=3)ans+=comb(n, 3)*comb(m, 3)*3*3*2*calc(n-3, m-3, k-5)*2;

    if(k-2>=2)ans+=comb(n, 2)*comb(m, 2)*calc(n-2, m-2, k-4);

    if(k-2>=3)ans+=comb(n, 3)*comb(m, 3)*6*6*calc(n-3, m-3, k-5);

    cout<<ans.val()<<endl;
    return 0;
}