#ifdef DEBUG
#define _GLIBCXX_DEBUG
#else
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast,unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define ALL(a) a.begin(), a.end()
#undef long
#define long long long
using namespace std;
using mint = atcoder::modint998244353;
ostream& operator<<(ostream& os, const mint& a) {
	return os << a.val();
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& a) {
	const int n = a.size();
	rep(i, n) os << a[i] << " \n"[i + 1 == n];
	return os;
}
template<typename T>
istream& operator>>(istream& os, const vector<T>& a) {
	for (T& i : a) os >> i;
	return os;
}
void chmin(int& x, int y) {
	if (x > y) x = y;
}
void chmax(int& x, int y) {
	if (x < y) x = y;
}
void solve() {
	long h, w, k; cin >> h >> w >> k;
	if (h * w == k) {
		cout << 1 << '\n';
		return;
	}
	k = h * w - k;
	constexpr int n = 1e6 + 2022;
	vector<mint> fact(n + 1), finv(n + 1);
	fact[0] = 1;
	for (int i = 1; i <= n; i++) fact[i] = i * fact[i - 1];
	finv[n] = fact[n].inv();
	for (int i = n; i >= 1; i--) finv[i - 1] = i * finv[i];
	auto com = [&](int nn, int kk) {
		return fact[nn] * finv[kk] * finv[nn - kk];
		};
	mint ans = 0;
	for (int i = 0; i < h; i++) {
		long bunsi = k - i * w;
		if (bunsi < 0) break;
		if (bunsi % (h - i) != 0) continue;
		long jj = bunsi / (h - i);
		if (jj < 0 || jj > w) continue;
		ans += com(h, i) * com(w, jj);
	}
	cout << ans << '\n';
}
int main() {
	// srand((unsigned)time(NULL));
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(40);
	solve();
	return 0;
}