#include<vector>
#include<iostream>
#include<fstream>
#include<string>
#include<algorithm>

using namespace std;

const int mod = 998244353;
int add(int a, int b)
{
    int c = a + b;
    if (c >= mod)
    {
        c -= mod;
    }
    return c;
}
int sub(int a, int b)
{
    int c = a - b;
    if (c <= mod)
    {
        c += mod;
    }
    return c;
}
int mlt(int a, int b)
{
    long long c = (long long)a* b;
    c %= mod;
    return (int)c;
}
int bp(int n, int pw)
{
    //cout << n << ' ' << pw << endl;
    if (pw == 0)
    {
        return 1;
    }
    if (pw % 2 == 0)
    {
        int bv = pw / 2;
        int val = bp(n, bv);
        return mlt(val, val);
    }
    int bv = pw - 1;
    return mlt(bp(n, bv), n);
}
int obr(int n)
{
    return bp(n, mod - 2);
}
int facts[2000007], ofacts[2000007];
void clc()
{
    facts[0] = 1;
    ofacts[0] = 1;
    for (int i = 1; i < 2000002; i++)
    {
        facts[i] = mlt(facts[i - 1], i);
    }
    //cout << "sss" << endl;
    ofacts[2000001] = obr(facts[2000001]);
    for (int i = 2000000; i >= 1; i--)
    {
        ofacts[i] = mlt(ofacts[i + 1], i + 1);
    }
}
int c(int a, int n)
{
    if (a < 0)
    {
        return 0;
    }
    if (a > n)
    {
        return 0;
    }
    int bv = facts[n];
    bv = mlt(bv, ofacts[a]);
    bv = mlt(bv, ofacts[n - a]);
    return bv;
}
int ans(int a, int b, int turns)
{
    if (turns % 2 == 1)
    {
        return 0;
    }
    int val = 1;
    for (int i = 1; i < turns; i += 2)
    {
        val = mlt(val, i);
    }
    int sum = 0;
    for (int k = 0; k <= min(a, b); k++)
    {
        int bv = 1;
        bv = mlt(bv, c(b - k, turns / 2));
        bv = mlt(bv, c(k, b));
        bv = mlt(bv, c(a - k, turns / 2 + b - k));
        sum = add(sum, bv);
    }
    sum = mlt(sum, val);
    return sum;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    clc();
    int turns, a, b;
    cin >> a >> b >> turns;
    cout << ans(a, b, turns) << endl;
    return 0;
}