MOD = 998244353

def pow_mod(a, b, mod):
    a %= mod
    res = 1
    while b > 0:
        if b % 2 == 1:
            res = res * a % mod
        a = a * a % mod
        b //= 2
    return res

def main():
    import sys
    N, M, K = map(int, sys.stdin.readline().split())
    
    if K == 1:
        print(M % MOD)
        return
    
    if K > M:
        print(pow_mod(M, 2*N, MOD))
        return
    
    # Now 2 <= K <= M
    term1 = (M - K + 1) % MOD
    term2 = (pow_mod(K, 2*N, MOD) - pow_mod(K-1, 2*N, MOD)) % MOD
    part1 = (term1 * term2) % MOD
    
    t = K-1
    part2 = pow_mod(t, 2*N, MOD)
    
    ans = (part1 + part2) % MOD
    print(ans)

if __name__ == '__main__':
    main()