mod = 998244353
def f(k, n):
    return (pow(M - k, n, mod) - pow(M - k - 1, n, mod))%mod

H, W, M = map(int, input().split())
ans = 0
for i in range(M):
    ans += f(i, H) * f(i, W)
    ans %= mod
    
print(ans)