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

mint ncr(int n, int r) {
    mint ret = 1;
    for (int i = 0; i < r; ++i) ret = ret * (n - i) / (i + 1);
    return ret;
}

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

    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 += ncr(H, d) * ncr(W, e);
    }

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