import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
class comb():
    def __init__(self,n,mod):
        self.fact = [0] * (n+1)
        self.fact_inv = [0] * (n+1)
        self.mod = mod

        self.fact[1] = 1
        self.fact_inv[1] = pow(1,mod-2,mod)
        self.fact[0] = 1
        self.fact_inv[0] = 1

        for i in range(2,n+1):
            self.fact[i] = (self.fact[i-1] * i) % mod
            self.fact_inv[i] = (self.fact_inv[i-1] * pow(i,mod-2,mod)) % mod
    def ncr(self,n,r):
        if n-r < 0:
            return 0
        return (self.fact[n] * self.fact_inv[r] * self.fact_inv[n-r]) % self.mod
    def nhr(self,n,r):
        return self.ncr(n+r-1,r)
input = sys.stdin.readline
#n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
h,w,m = map(int,input().split())
if h-1+w-1+1 > m:
    exit(print(0))
ans = 0
mod = 998244353
c = comb(200000,mod)
ans += c.ncr(m,h-1+w-1+1) * c.ncr(h-1+w-1,h-1) * pow(m,h*w-(h-1+w-1+1),mod)
ans %= mod
print(ans)