#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long H,W,K; cin >> H >> W >> K;
    long long mod = 998244353;
    if(H < W) swap(H,W);

    vector<long long> fac(H+1,1),inv(H+1),facinv(H+1,1);
    for(int i=1; i<=H; i++) fac.at(i) = fac.at(i-1)*i%mod;
    inv.at(1) = 1;
    for(int i=2; i<=H; i++) inv.at(i) = mod-(mod/i*inv.at(mod%i)%mod);
    for(int i=1; i<=H; i++) facinv.at(i) = facinv.at(i-1)*inv.at(i)%mod;

    long long answer = 0;
    for(int i=0; i<H; i++){
        long long h = fac.at(H)*facinv.at(H-i)%mod*facinv.at(i)%mod,leftK = H*W-W*i-K;
        if(leftK%(H-i) != 0 || leftK < 0) continue;
        long long w = leftK/(H-i);
        w = fac.at(W)*facinv.at(W-w)%mod*facinv.at(w)%mod;
        answer = (answer+h*w)%mod;
    }
    if(K == 0){
        long long power2 = 1;
        for(int i=0; i<H; i++) power2 = power2*2%mod;
        answer += power2;
        power2 = 1;
        for(int i=0; i<W; i++) power2 = power2*2%mod;
        answer += power2;
        answer = (answer-1)%mod;
    }
    cout << answer << endl;
}