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

mint facs[1000001];

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

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

    mint ret = 0;
    for (long long d = 1; d <= H; ++d) {
        if (K % d) continue;
        long long e = K / d;
        if (e > W) continue;

        ret += facs[H] / facs[d] / facs[H - d] * facs[W] / facs[e] / facs[W - e];
    }

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