N,M,K = map(int,input().split())
if K == 1:
  print(M)
  exit()
  
mod = 998244353
def pow_k(x, n,mod):
    """
    O(log n)
    """
    if n == 0:
        return 1
    K = 1
    while n > 1:
        if n % 2 != 0:
            K = (K*x) % mod
        x = (x*x) % mod
        n //= 2
    return (K * x)%mod
if M <= K:
  ans = pow_k(M,2*N,mod)
  print(ans)
else:
  ans = pow_k(K,2*N,mod)

  ss = pow_k(K-1,2*N,mod)
  
  print((ans+(M-K)*(ans-ss))%mod)