#include<bits/stdc++.h>
using namespace std;
constexpr int M=1e6+5,mod=998244353;
int fac[M],ifac[M];
int qpow(int x,int n){
    int s=1; while (n){
        if (n&1) s=1ll*s*x%mod;
        x=1ll*x*x%mod; n>>=1;
    } return s;
}
void init(int n){
    for (int i=fac[0]=1;i<=n;i++) fac[i]=1ll*fac[i-1]*i%mod;
    ifac[n]=qpow(fac[n],mod-2);
    for (int i=n;i;i--) ifac[i-1]=1ll*ifac[i]*i%mod;
}
int c(int n,int m){return n<m||m<0?0:1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;}
int main(){ int n,k;
    scanf("%d%d",&n,&k);init(max(n,k));
    int p=(k+1>>1)-1,ans=0;
    ans=1ll*(n+1>>1)*qpow(n,k)%mod;
    if (n%2==0){
        const int i=n>>1;
        for (int j=0;j<=p;j++)
            ans=(ans+1ll*qpow(i,j)*qpow(n-i,k-j)%mod*c(k,j))%mod;
    }
    if (k%2==0){
        for (int i=0;i<<1<n;i++){
            const int j=k/2;
            ans=(ans-1ll*qpow(i,j)*qpow(n-i,k-j)%mod*c(k,j))%mod;
        }
    }
    if (ans<0) ans+=mod;
    printf("%d\n",ans);
    return 0;
}