#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define pii pair<int,int>
#define st first
#define nd second
using namespace std;
inline int read(){
    int x=0,f=1;char ch=getchar();
    for(;!isdigit(ch);ch=getchar())f^=ch=='-';
    for(;isdigit(ch);ch=getchar())x=x*10+(ch^48);
    return f?x:-x;
}
mt19937 rnd(time(0));
const int mo=998244353;
inline int qpow(int x,int t){
    int ret=1;
    for(;t;t>>=1,x=x*x%mo)if(t&1)ret=ret*x%mo;
    return ret;
}
inline void red(int &x){x>=mo?x-=mo:0;}
inline void chmin(int &x,int y){x=min(x,y);}
inline void chmax(int &x,int y){x=max(x,y);}

const int N=1e6+5;
int ans,fac[N],ifac[N],n,k,d;
inline int C(int x,int y){
    if(y>x||x-y>x)return 0;
    return fac[x]*ifac[y]%mo*ifac[x-y]%mo;
}
void solve(){
    n=read(),k=read();
    if(k&1)printf("%lld\n",(n+1)*qpow(2,mo-2)%mo*qpow(n,k)%mo);
    else{
        int tmp=(n+1)*qpow(2,mo-2)%mo*qpow(n,k)%mo;
        for(int i=1;i<n;++i){
            red(d+=C(k,k/2)*qpow(i,k/2)%mo*qpow(n-i,k/2)%mo);
        }
        d=d*qpow(2,mo-2)%mo;
        printf("%lld\n",(tmp+mo-d)%mo);
    }
    return;
}
signed main(){
    fac[0]=1;
    for(int i=1;i<N;++i)fac[i]=fac[i-1]*i%mo;
    ifac[N-1]=qpow(fac[N-1],mo-2);
    for(int i=N-1;i;--i)ifac[i-1]=ifac[i]*i%mo;
    for(int cas=1;cas--;)solve();
    return 0;
}