#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int H, W;
  long long K;
  cin >> H >> W >> K;
  int N = max(H, W);
  vector<long long> inv(N + 1);
  inv[1] = 1;
  for (int i = 2; i <= N; i++){
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
  }
  vector<long long> fact(N + 1);
  vector<long long> finv(N + 1);
  fact[0] = 1;
  finv[0] = 1;
  for (int i = 1; i <= N; i++){
    fact[i] = fact[i - 1] * i % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
  auto binom = [&](int n, int k){
    return fact[n] * finv[k] % MOD * finv[n - k] % MOD;
  };
  long long ans = 0;
  for (int i = 1; i <= H; i++){
    if (K % i == 0 && K / i <= W){
      ans += binom(H, i) * binom(W, K / i);
      ans %= MOD;
    }
  }
  cout << ans << endl;
}