MOD = 998244353

def ncr(n, r):
    ret = 1
    for i in range(n-r+1, n+1):
        ret *= i
        ret %= MOD
    for i in range(1, r+1):
        ret *= pow(i, MOD-2)
        ret %= MOD
    return ret

def pow(x, k):
    x %= MOD
    ret = 1
    while k > 0:
        if k & 1:
            ret *= x
            ret %= MOD
        x = x * x
        x %= MOD
        k >>= 1
    return ret

H,W,M = map(int,input().split())
if H + W - 1 > M:
    print(0)
else:
    print((ncr(H+W-2, H-1) * ncr(M, H+W-1) * pow(M, H*W-H-W+1)) % MOD)