import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
input = sys.stdin.readline
h,w,k = map(int,input().split())
mod = 998244353
ans = 0
class comb():
    def __init__(self,n,mod):
        self.fact = [0] * (n+1)
        self.fact_inv = [0] * (n+1)
        self.mod = mod

        self.fact[1] = 1
        self.fact_inv[1] = pow(1,mod-2,mod)
        self.fact[0] = 1
        self.fact_inv[0] = 1

        for i in range(2,n+1):
            self.fact[i] = (self.fact[i-1] * i) % mod
            self.fact_inv[i] = (self.fact_inv[i-1] * pow(i,mod-2,mod)) % mod
        
    def ncr(self,n,r):
        return (self.fact[n] * self.fact_inv[r] * self.fact_inv[n-r]) % self.mod
c = comb(10**6+10,mod)
for i in range(h+1):
    if i == 0:
        if (h*w-k) % h == 0:
            j = (h*w-k) // h
            ans += c.ncr(h,i) * c.ncr(w,j)
            ans %= mod
            continue
    if i == h:
        if k == 0:
            ans += pow(2,w,mod)
            ans %= mod
        continue
            
    if (h*w - k - i*w) % (h - i) == 0:
        j = (h*w - k - i*w) // (h - i)
        if j < 0:
            continue
        ans += c.ncr(h,i) * c.ncr(w,j)
        ans %= mod
print(ans)