MOD = 998244353

def main():
    import sys
    input = sys.stdin.read
    N, M, K = map(int, input().split())
    
    if K == 0:
        print(0)
        return
    
    max_fact = max(M, K)
    # Precompute factorial and inverse factorial modulo MOD
    fact = [1] * (max_fact + 1)
    for i in range(1, max_fact + 1):
        fact[i] = fact[i-1] * i % MOD
    inv_fact = [1]*(max_fact +1)
    inv_fact[max_fact] = pow(fact[max_fact], MOD-2, MOD)
    for i in range(max_fact-1, -1, -1):
        inv_fact[i] = inv_fact[i+1] * (i+1) % MOD
    
    # Calculate C(M, K)
    if M < K:
        cmk = 0
    else:
        cmk = fact[M] * inv_fact[K] % MOD
        cmk = cmk * inv_fact[M - K] % MOD
    
    # Precompute M^N mod MOD
    pow_m = pow(M, N, MOD)
    
    sum_terms = 0
    for i in range(0, K+1):
        # Compute C(K, i)
        comb_ki = fact[K] * inv_fact[i] % MOD
        comb_ki = comb_ki * inv_fact[K - i] % MOD
        
        # (-1)^i mod MOD
        term_sign = 1 if i % 2 == 0 else MOD -1
        
        base = (M + K - i) % MOD
        a = pow(base, N, MOD)
        b = pow_m
        
        current = (a - b) % MOD
        current = (current + MOD) % MOD  # Ensure non-negative
        
        term = (term_sign * comb_ki) % MOD
        term = (term * current) % MOD
        
        sum_terms = (sum_terms + term) % MOD
    
    ans = (cmk * sum_terms) % MOD
    print(ans)

if __name__ == "__main__":
    main()