mod = 998244353

max_fact = 4*10**5 + 10
fact = [1]
for i in range(1, max_fact):
    fact.append(fact[-1] * i % mod)
fact_inv = [0] * max_fact
fact_inv[-1] = pow(fact[-1], mod - 2, mod)
for i in reversed(range(1, max_fact)):
    fact_inv[i - 1] = fact_inv[i] * i % mod


def comb(a, b):
    if a < 0 or b < 0:
        return 0
    elif a < b:
        return 0
    return fact[a] * fact_inv[b] % mod * fact_inv[a - b] % mod


h, w, k = map(int, input().split())
n = min(h, w)
ans = 0
if k > 300:
    k2 = (k + 2) // 2

    for i in range(n):
        s = comb(2*i, i)
        j = 1
        while i - j * k2 >= 0:
            if j % 2 == 0:
                s += comb(2*i,  i - j * k2) * 2
            else:
                s -= comb(2*i,  i - j * k2) * 2
            j += 1
        ans += s * comb(h+w-2, h-1-i) * comb(w+i-1, w-i-1)
        ans %= mod

else:
    k2 = k // 2
    dp1 = [0] * (k2 * 2 + 1)
    dp1[k2] = 1
    for i in range(n):
        dp2 = [0] * (k2 * 2 + 1)
        for j in range(k2 * 2 + 1):
            if j != 0:
                dp2[j] += dp2[j-1]
            if i != 0 and j != k2 * 2:
                dp2[j] += dp1[j+1]
            dp2[j] %= mod
        dp1 = dp2

    for i in range(n):
        ans += dp1[k2] * comb(h+w-2, h-1-i) * comb(w+i-1, w-i-1)
        ans %= mod
print(ans)