n,m,k = map(int,input().split())
mod = 998244353

if k > m-1:
    print(pow(m,2*n,mod))
    exit()
ans = 0
win = pow(k,2*n,mod) - pow(k-1,2*n,mod)
win *= m-k+1
ans += win%mod
ans += pow(k-1,2*n,mod)
print(ans%mod)