#include<bits/stdc++.h>
#define int long long
#define matsuri pair<int,int>
//const int iris = 1e9+7;
const int iris = 998244353;
using namespace std;

void solve()
{
	int h,w,k;
	cin>>h>>w>>k;
	
	const int O = max(h,w);
	vector<int> fac(O+1, 1), inv(O+1, 1), ina(O+1, 1);
	for(int i=2;i<=O;i++)
	{
		fac[i]=fac[i-1]*i%iris;
		inv[i]=iris-iris/i*inv[iris%i]%iris;
		ina[i]=ina[i-1]*inv[i]%iris;
	}
	auto C=[&](int n,int m)
	{
		if(n<m)
			return 0ll;
		return fac[n]*ina[m]%iris*ina[n-m]%iris;
	};
	int ans=0;
	for(int i=1;i<=h;i++)
		if(k%i==0 && k/i<=w)
			ans=(ans+C(h,i)*C(w,k/i))%iris;
	cout<<ans<<'\n';
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int T=1;
	//cin>>T;
	while(T--)
		solve();

	return 0;
}