MOD = 998244353

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

if k > m:
    print(pow(m, 2 * n, MOD))
else:
    term1 = ((m - k + 1) % MOD) * pow(k, 2 * n, MOD) % MOD
    term2 = ((m - k) % MOD) * pow(k - 1, 2 * n, MOD) % MOD
    ans = (term1 - term2) % MOD
    print(ans)