import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

class Binom:
    def __init__(self, n, mod):
        self.n = n
        self.mod = mod
        self.fact = [1,1]
        self.factinv = [1,1]
        self.inv = [0,1]
        self._calc(n, mod)
    
    def _calc(self, n, mod):
        for i in range(2, n+1):
            self.fact.append((self.fact[-1]*i) % mod)
            self.inv.append((-self.inv[mod % i]*(mod//i)) % mod)
            self.factinv.append((self.factinv[-1]*self.inv[-1]) % mod)

    def comb(self,n,r):
        return self.fact[n]*self.factinv[r]%self.mod*self.factinv[n-r]%self.mod
    
    def perm(self,n,r):
        return self.fact[n]*self.factinv[n-r]%self.mod




h,w,k = map(int,input().split())
k = h*w-k
mod = 998244353
binom = Binom(10**6+10, mod)
ans = 0
for r in range(h+1):
    cnt = r*w
    left = k-cnt
    if left < 0: continue
    if left % (h-r) != 0: continue
    c = left // (h-r)
    if c > w: continue
    ans += binom.comb(h,r) * binom.comb(w, c)
    ans %= mod

print(ans)