#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long pw(long long t1, long long t2) {
    long long tmp1 = 1, tmp2 = t1;
    while (t2) {
        if (t2 & 1)
            tmp1 = tmp1 * tmp2 % mod;
        tmp2 = tmp2 * tmp2 % mod;
        t2 /= 2;
    }
    return tmp1;
}
int n, k;
const int maxn=1e6+5;
int fct[maxn],inv[maxn];
int c(int x,int y)
{
    return fct[x]*1ll*inv[x-y]%mod*inv[y]%mod;
}
int main() {
    scanf("%d%d", &n, &k);
    fct[0]=inv[0]=1;
    for(int i=1;i<=k;i++)fct[i]=fct[i-1]*1ll*i%mod,inv[i]=pw(fct[i],mod-2);
    if (k & 1) {
        printf("%d\n", pw(n, k) * 1LL * (n + 1) % mod * pw(2, mod - 2) % mod);
    } else {
        int ans = 0;
        for (int i = 1; i < n; i++) {
            ans += pw(i, k / 2) * 1LL * pw(n - i, k / 2) % mod*c(k,k/2)%mod;
            ans %=mod;
        }
        ans = ans * 1LL * pw(pw(n,k), mod - 2)%mod;
        //cout<<ans<<endl;
        ans = ((n + 1) * 1LL * pw(2, mod - 2) % mod - ans * 1LL * pw(2, mod - 2) % mod + mod) % mod;
        ans = ans*1LL*pw(n, k)%mod;
        printf("%d\n", ans);
    }
}