#include <bits/stdc++.h>

#include <atcoder/all>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
using mint = atcoder::modint998244353;
int main() {
  int N, K;
  cin >> N >> K;
  cout << (mint(N) * mint(K) * mint(K - 1) / mint(K).pow(N)).val() << endl;
  cerr << (mint(N) * mint(K) * mint(K - 1)).val() << endl;
  cerr << mint(K).pow(N).val() << endl;
}