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


#include<atcoder/modint>
using mint = atcoder::modint998244353;

const int mx = 2e6;
mint fac[mx+1],ifac[mx+1];
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    fac[0] = 1;
    for(int i = 1;i<=mx;i++) fac[i] = fac[i-1] * i;
    for(int i = 0;i<=mx;i++) ifac[i] = fac[i].inv();

    ll h,w;
    cin>>h>>w;
    ll k;
    cin>>k;
    ll want = h * w - k;
    mint ans = 0;
    for(int i = 0;i<=h;i++){
        mint tmp = fac[h] * ifac[i] * ifac[h-i];
        ll now = w * i;
        if(now>want) continue;
        ll res = want - now;
        ll one = h - i;
        if(res%one!=0) continue;
        ll can = res / one;
        if(can>w) continue;
        tmp *= fac[w] * ifac[can] * ifac[w-can];
        ans += tmp;
    }
    cout<<ans.val()<<endl;
}