## https://yukicoder.me/problems/no/1836

MOD = 998244353

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

    # min(a) = min(b) = mとなるa,bの組みを求める
    # 実はmin(a) = min(b) となるa,bと該当する行列Cは1対1対応
    answer = 0
    for m in range(1, M + 1):
        ans_h = 0
        if m < M:
            ans_h = pow(M - m + 1, H, MOD) - pow(M - m, H, MOD)
        else:
            ans_h = pow(M - m + 1, H, MOD)
        ans_w = 0
        if m < M:
            ans_w = pow(M - m + 1, W, MOD) - pow(M - m, W, MOD)
        else:
            ans_w = pow(M - m + 1, W, MOD)
        answer += (ans_h * ans_w) % MOD
        answer %= MOD
    print(answer)


if __name__ == "__main__":
    main()