#include <atcoder/modint>
#include <iostream>
using mint = atcoder::modint998244353;

mint f[1000001];

int main() {
    long long H, W, K;
    std::cin >> H >> W >> K;

    f[0] = 1;
    for (int i = 1; i <= 1000000; ++i) f[i] = f[i - 1] * i;

    mint ret = 0;
    for (int d = 1; d <= H; ++d) {
        auto e = K / d;
        if (K % d or e > W) continue;
        ret += f[H] / f[d] / f[H - d] * f[W] / f[e] / f[W - e];
    }

    std::cout << ret.val() << '\n';
}