#include <stdio.h>

long long power_mod (long long a, long long b, long long mod_num) {
  long long ans = 1LL;
  
  if (b > 0LL) {
    ans = power_mod(a, b/2LL, mod_num);
    ans = (ans * ans) % mod_num;
    if (b%2LL == 1LL) {
      ans = (ans * (a % mod_num)) % mod_num;
    }
  }
  
  return ans;
}

int main () {
  int h = 0;
  int w = 0;
  long long k = 0LL;
  
  int res = 0;
  
  long long ans = 0LL;
  long long mod_num = 998244353LL;
  
  long long fact[1000001] = {};
  long long invf[1000001] = {};
  
  res = scanf("%d", &h);
  res = scanf("%d", &w);
  res = scanf("%lld", &k);
  
  fact[0] = 1LL;
  for (int i = 0; i < 1000000; i++) {
    fact[i+1] = fact[i];
    fact[i+1] *= (long long)(i+1);
    fact[i+1] %= mod_num;
  }
  
  invf[1000000] = power_mod(fact[1000000], mod_num-2LL, mod_num);
  for (int i = 1000000; i > 0; i--) {
    invf[i-1] = invf[i];
    invf[i-1] *= (long long)i;
    invf[i-1] %= mod_num;
  }
  
  for (int i = 0; i < h; i++) {
    if (k%((long long)(h-i)) == 0LL && k/((long long)(h-i)) <= w) {
      int j = (int)(k/((long long)(h-i)));
      long long tmp = fact[h]*invf[i];
      tmp %= mod_num;
      tmp *= invf[h-i];
      tmp %= mod_num;
      tmp *= fact[w];
      tmp %= mod_num;
      tmp *= (invf[j]*invf[w-j])%mod_num;
      ans += tmp%mod_num;
    }
  }
  
  printf("%lld\n", ans%mod_num);
  return 0;
}