#include <iostream>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef double db;

const int N = 1e6 + 7;
const int Mod = 998244353;

ll qpow(ll x, ll y)
{
    ll ret = 1;
    while (y)
    {
        if (y & 1)
            ret = ret * x % Mod;
        x = x * x % Mod, y >>= 1;
    }
    return ret;
}

ll fac[N], ifac[N];

ll C(int n, int m)
{
    return fac[n] * ifac[m] % Mod * ifac[n - m] % Mod;
}

int main()
{
    // ios::sync_with_stdio(false);
    int n, K;
    cin >> n >> K;
    fac[0] = 1;
    for (int i = 1; i < N; i++)
        fac[i] = fac[i - 1] * i % Mod;
    ifac[N - 1] = qpow(fac[N - 1], Mod - 2);
    for (int i = N - 2; ~i; i--)
        ifac[i] = ifac[i + 1] * (i + 1) % Mod;
    ll ans = (n + 1) * qpow(n, K) % Mod, tmp = 0;
    if (K & 1)
        ;
    else
    {
        for (int i = 1; i <= n; i++)
            tmp = (tmp + qpow(i, K / 2) * qpow(n - i, K / 2) % Mod) % Mod;
        ans = (ans - C(K, K / 2) * tmp % Mod + Mod) % Mod;
    }
    cout << ans * qpow(2ll, Mod - 2) % Mod;
}