#include <bits/stdc++.h>
#include <atcoder/modint>

using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;

vector<ll> factor;

void all_factor(ll n){
    factor.clear();
    vector<ll> factor2;
    for (ll i = 1; i*i <= n; i++){
        if (n % i == 0){
            factor.push_back(i);
            if (i*i != n) factor2.push_back(n / i);
        }
    }
    factor.insert(factor.end(), factor2.rbegin(), factor2.rend());
}

const ll MAX=3e6;
vector<mint> f, finv;

void init(){
    f.resize(MAX+1); finv.resize(MAX+1);
    f[0] = 1;
    for (int i=1; i<=MAX; i++) f[i] = f[i-1]*i;
    finv[MAX] = f[MAX].inv();
    for (int i=MAX-1; i>=0; i--) finv[i] = finv[i+1] * (i+1);
}

mint C(ll n, ll k){
    if (n < k || k < 0) return 0;

    return f[n] * finv[k] * finv[n-k] ;
}

int main(){

    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    init();

    ll H, W, K;
    mint ans=0;
    cin >> H >> W >> K;
    all_factor(K);

    for (auto x : factor) ans += C(H, x) * C(W, K/x);
    
    cout << ans.val() << endl;

    return 0;
}