MOD = 998244353

H, W, M = map(int, input().split())

result = 0
for m in range(1, M + 1):
    # Calculate the number of valid a's for current m
    a_count = (pow(M - m + 1, H, MOD) - pow(M - m, H, MOD)) % MOD
    # Calculate the number of valid b's for current m
    b_count = (pow(M - m + 1, W, MOD) - pow(M - m, W, MOD)) % MOD
    # Multiply and add to the result
    result = (result + a_count * b_count) % MOD

print(result % MOD)