#include <iostream>
#include <cassert>
using namespace std;
typedef long long ll;

const ll mod = 998244353;

ll my_pow(ll x, ll n, ll mod){
    //　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0){
        ret = 1;
    }
    else if (n % 2 == 1){
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    }
    else{
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod){
    return my_pow(x, mod - 2, mod);
}

int main(){
    ll N, K;
    cin >> N >> K;
    assert(3 <= N && N <= 100000);
    assert(2 <= K && K <= 100000);
    ll ans = (N * K * (K - 1)) % mod;
    ans = (ans * inv(my_pow(K, N, mod), mod)) % mod;
    cout << ans << endl;
}