#include <bits/stdc++.h>

#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;
void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

mint fact[1 << 20], fact_inv[1 << 20];
void calc_fact() {
    fact[0] = 1;
    for (int i = 1; i < (1 << 20); i++) {
        fact[i] = fact[i - 1] * i;
    }
    fact_inv[(1 << 20) - 1] = fact[(1 << 20) - 1].inv();
    for (int i = (1 << 20) - 2; i >= 0; i--) {
        fact_inv[i] = fact_inv[i + 1] * (i + 1);
    }
}
mint binom(int n, int k) {
    if (n < k || n < 0 || k < 0) return 0;
    return fact[n] * fact_inv[k] * fact_inv[n - k];
}
int main() {
    fast_io();
    calc_fact();
    int h, w;
    long long k;
    cin >> h >> w >> k;
    mint ans = 0;
    for (int i = 0; i < h; i++) {
        if (k % (h - i)) {
            continue;
        }
        int j = w - k / (h - i);
        ans += binom(h, i) * binom(w, j);
    }
    cout << ans.val() << endl;
}