#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

long long power(long long x, long long y){
    x%=MOD;
    long long ret=1;
    while(y){
        if(y&1) ret=ret*x%MOD;
        x=x*x%MOD;
        y>>=1;
    }
    return ret;
}

int main(){
    ll n, m, k;
    cin >> n >> m >> k;
    ll ans=0;
    if(m-k+1>0){
        ans+=(m%MOD-k%MOD+MOD+1)*(power(k,2*n)+MOD-power(k-1,2*n))%MOD;
        ans+=power(k-1,2*n);
    }
    else
        ans+=power(m,2*n);
    cout << ans%MOD << endl;
    return 0;
}