#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using mint = atcoder::modint998244353;

struct combination {
	vector<mint> fac, infac;
	combination(int n) {
		fac.resize(n+1);
		infac.resize(n+1);
		fac[0] = 1;
		for (int i = 1; i <= n; i++) fac[i] = fac[i-1] * i;
		infac[n] = fac[n].inv(); 
		for (int i = n; i >= 1; i--) infac[i-1] = infac[i] * i;
	}
	mint operator()(int n, int c) {
		if (c > n) return 0;
		return fac[n]*infac[c]*infac[n-c];
	}
} comb(1000009);

int main() {
	int h, w; cin >> h >> w;
	long long k; cin >> k;
	vector<long long> D; 
	for (long long d = 1; d*d <= k; d++) {
		if (k%d) continue;
		D.push_back(d);
		if (k != d * d) D.push_back(k/d);
	}
	mint ans = 0;
	for (auto t : D) {
		//tate : d
		long long y = k/t;
		ans += comb(h, t) * comb(w, y);
	}
	cout << ans.val() << endl;
}