## https://yukicoder.me/problems/no/2527

import math

MOD = 998244353


class CombinationCalculator:
    """
    modを考慮したPermutation, Combinationを計算するためのクラス
    """    
    def __init__(self, size, mod):
        self.mod = mod
        self.factorial = [0] * (size + 1)
        self.factorial[0] = 1
        for i in range(1, size + 1):
            self.factorial[i] = (i * self.factorial[i - 1]) % self.mod
        
        self.inv_factorial = [0] * (size + 1)
        self.inv_factorial[size] = pow(self.factorial[size], self.mod - 2, self.mod)

        for i in reversed(range(size)):
            self.inv_factorial[i] = ((i + 1) * self.inv_factorial[i + 1]) % self.mod

    def calc_combination(self, n, r):
        if n < 0 or n < r:
            return 0

        if r == 0 or n == r:
            return 1
        
        ans = self.inv_factorial[n - r] * self.inv_factorial[r]
        ans %= self.mod
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
    
    def calc_permutation(self, n, r):
        if n < 0 or n < r:
            return 0

        ans = self.inv_factorial[n - r]
        ans *= self.factorial[n]
        ans %= self.mod
        return ans
        

def main():
    H, W, K = map(int, input().split())

    # Kの約数列挙
    sqrt_k = int(math.sqrt(K))
    array = []
    for p in range(1, sqrt_k + 1):
        if K % p == 0:
            q = K // p
            array.append(p)
            if p != q:
                array.append(q)
    
    combi = CombinationCalculator(max(H, W), MOD)
    answer = 0
    for h in array:
        if h > H:
            continue
        w = K // h
        if w > W:
            continue
        h0 = H - h 
        w0 = W - w
        answer += (combi.calc_combination(H, h0) * combi.calc_combination(W, w0)) % MOD
        answer %= MOD
    print(answer)



if __name__ == "__main__":
    main()