n,m,k = map(int,input().split())
mod = 998244353
if m <= k:
  print(pow(m, 2*n, mod))
  exit()

ans = (m-k)*(pow(k, 2*n, mod)- pow(k-1, 2*n, mod)) + pow(k, 2*n, mod)
print(ans%mod)