// (⁠◕⁠ᴗ⁠◕⁠✿⁠)
 
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define srep(i, s, n) for (ll i = s; i < (n); i++)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using vvv = vv<vc<T>>;
using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;
using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;
using uint = unsigned int;
using ull = unsigned long long;
const ld pi = 3.141592653589793;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
// const ll mod = 1000000007;
const ll mod = 998244353;
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }

#define debug(var)  do{std::cout << #var << " : \n";view(var);}while(0)
template<typename T> void view(T e){cout << e << endl;}
template<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << " "; } cout << endl;}
template<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }

struct modint {
    ll val;
    using mint = modint;
    modint() {};
    modint(ll v) {
        if (0 <= v && v < mod) val = v;
        else{
            v %= mod;
            if (v < 0) v += mod;
            val = v;
        }
    }
    mint operator++(int){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    mint operator--(int){
        if (val == 0) val = mod;
        val--;
        return *this;
    }
    mint& operator+=(const mint& v){
        val += v.val;
        if (val > mod) val -= mod;
        return *this;
    }
    friend mint operator+(const mint& u, const mint& v){
        return mint(u) += v;
    }
    mint& operator-=(const mint& v){
        val -= v.val;
        if (val < 0) val += mod;
        return *this;
    }
    friend mint operator-(const mint& u, const mint& v){
        return mint(u) -= v;
    }
    mint& operator*=(const mint& v){
        val *= v.val;
        if (val > mod) val %= mod;
        return *this;
    }
    friend mint operator*(const mint& u, const mint& v){
        return mint(u) *= v;
    }
    mint pow(ll n){
        mint a = *this, ret = 1;
        while (n > 0){
            if (n & 1) ret *= a;
            a *= a;
            n >>= 1;
        }
        return ret;
    }
    mint operator/=(const mint& v){
        val *= mint(v).pow(mod - 2).val;
        if (val > mod) val %= mod;
        return *this;
    }
    friend mint operator/(const mint& u, const mint& v){
        return mint(u) /= v;
    }
    friend bool operator==(const mint& u, const mint& v){
        return u.val == v.val;
    }
    friend bool operator!=(const mint& u, const mint& v){
        return u.val != v.val;
    }
    friend bool operator>(const mint& u, const mint& v){
        return u.val > v.val;
    }
    friend bool operator<(const mint& u, const mint& v){
        return u.val < v.val;
    }
};

using mint = modint;

struct Binoms {
    public : 
        Binoms(int n){
            fact = vc<mint>(1, 1);
            inv_fact = vc<mint>(1, 1);
            update(n);
        };

        void update(int n){
            if (sz >= n) return;
            fact.resize(n + 1, 1);
            inv_fact.resize(n + 1, 1);
            for (int i = sz; i < n; i++) fact[i + 1] = fact[i] * (i + 1);
            inv_fact[n] = 1 / fact[n];
            for (int i = n - 1; i >= sz + 1; i--) inv_fact[i] = inv_fact[i + 1] * (i + 1);
            sz = n;
            return;
        }

        mint C(int n, int k){
            if (sz < n) update(n);
            return fact[n] * inv_fact[n - k] * inv_fact[k];
        }

        mint fac(int n){
            if (sz < n) update(n);
            return fact[n];
        }

    private :
        int sz = 0;
        vc<mint> fact, inv_fact;
};

int main(){
    ll H, W, K; cin >> H >> W >> K;
    mint ret = 0;
    ll i = 1;
    Binoms B(1);
    while (i * i <= K){
        if (K % i == 0){
            ll p = i, q = K / i;
            if (p <= H && q <= W) ret += B.C(H, p) * B.C(W, q);
            if (q <= H && p <= W && p != q) ret += B.C(H, q) * B.C(W, p);
        }
        i++;
    }
    cout << ret.val << endl;
}