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

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

int main() {
	constexpr int MAX_SIZE = 1<<21;
	vector<mint> factorial(MAX_SIZE, mint(1));
	vector<mint> factorial_inv(MAX_SIZE, mint(1));
	for( int i = 1; i < MAX_SIZE; i++ ) {
		factorial[i] = factorial[i-1]*i;
		factorial_inv[i] = factorial[i].inv();
	}
	auto binom = [&](int n, int r) -> mint {
		if( 0 <= r && r <= n ) return factorial[n]*factorial_inv[n-r]*factorial_inv[r];
		else return mint(0);
	};
	long long H, W, K;
	cin >> H >> W >> K;
	mint ans = 0;
	K = H*W-K;
	for( long long x = 0; x < H; x++ ) {
		if( (K-W*x)%(H-x) == 0 ) {
			long long y = (K-W*x)/(H-x);
			ans += binom(H, x)*binom(W, y);
		}
	}
	if( K == H*W ) {
		for( long long y = 0; y <= W; y++ ) {
			ans += binom(H, H)*binom(W, y);
		}
	}
	cout << ans.val() << endl;
}