#include <bits/stdc++.h>
#include <atcoder/modint>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using mint = atcoder::modint998244353;
const int MAX = 2000005;
vector<mint> fac(MAX, mint(1));

void COMinit() {
    for(int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * mint(i);
    }
}

mint COM(int n, int k){
    if(n < k) return mint(0);
    if(n < 0 || k < 0) return mint(0);
    return fac[n] / fac[k] / fac[n - k];
}
int main() {
  cin.tie(0); cout.tie(0);
  ios::sync_with_stdio(false);
  COMinit();
  long H, W, K;
  cin >> H >> W >> K;
  mint ans = 0;
  for(int i = 0; i < H; i++) {
    long rem = W * i;
    if((H * W - rem - K) % (H - i) == 0 && 0 <= (H * W - rem - K) / (H - i) && (H * W - rem - K) / (H - i) <= W) {
      ans += COM(H, i) * COM(W, (H * W - rem - K) / (H - i));
    }
  }
  cout << ans.val() << '\n';
  return 0;
}