// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>

#define ll long long

using namespace std;

const int MOD = 998244353;

ll exp(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res % MOD;
}

vector<ll> factorial;

void generate_factorial(int m) {
    factorial.resize(m + 1);
    factorial[0] = 1;

    for (ll i = 1; i <= m; i++) {
        factorial[i] = factorial[i - 1] * i; factorial[i] += MOD; factorial[i] %= MOD;
    }
}

ll choose(ll a, ll b) {
    ll tmp = factorial[a];

    tmp *= exp(factorial[a - b], MOD - 2); tmp += MOD; tmp %= MOD;
    tmp *= exp(factorial[b], MOD - 2); tmp += MOD; tmp %= MOD;

    return tmp;
}

signed main() {
	int N, K; cin >> N >> K;

	generate_factorial(max(N + 1, K));

    if (K % 2 == 1) {
        ll ans = (N + 1) * exp(N, K) % MOD;
        ans *= exp(2, MOD - 2); ans %= MOD;

        cout << ans << "\n";
        return 0;
    }

	ll ans = 0;

	for (int i = 1; i < N; i++) {
		ll tmp = choose(K, K / 2) * exp(i, K / 2) % MOD;
		tmp = tmp * exp(N - i, K / 2) % MOD;

		ans += tmp; ans %= MOD;
	}

    ll tmp2 = (N + 1) * exp(N, K) % MOD;

    tmp2 -= ans; tmp2 += MOD; tmp2 %= MOD;

    tmp2 *= exp(2, MOD - 2); tmp2 %= MOD;

	cout << tmp2 << "\n";
}