#include constexpr int MOD = 998244353; int main() { int n, k; scanf("%d%d", &n, &k); int ans = 0; std::vector a; auto dfs = [&](auto&& dfs, int i) -> void { if(i == n) { int max1 = std::max(a[0], a[1]); int max2 = std::min(a[0], a[1]); for(int i = 2; i < n; i++) { if(a[i] > max1) { max2 = max1; max1 = a[i]; } else if(a[i] > max2) { max2 = a[i]; } } ans = (ans + max2) % MOD; return; } for(int d = 1; d <= k; d++) { a.push_back(d); dfs(dfs, i + 1); a.pop_back(); } }; dfs(dfs, 0); printf("%d\n", ans); return 0; }