#include <bits/stdc++.h>
using namespace std;

#ifdef _RUTHEN
#include <debug.hpp>
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;


long long pow_mod(long long a, long long n, const long long mod) {
    assert(n >= 0 and mod >= 1);
    if (mod == 1) return 0;
    a %= mod;
    if (a < 0) a += mod;
    long long res = 1;
    while (n) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

void solve() {
    ll N, M, K;
    cin >> N >> M >> K;
    const ll P = 998244353;
    if (M <= K) {
        cout << pow_mod(M, 2 * N, P) << '\n';
    } else {
        // M > K
        ll ans = pow_mod(K, 2 * N, P) + (M - K) % P * (pow_mod(K, 2 * N, P) - pow_mod(K - 1, 2 * N, P)) % P;
        ans %= P;
        if (ans < 0) ans += P;
        cout << ans << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    while (tt--) solve();
    return 0;
}