#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e6+5,M=N*40+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,k;ll frc[N],inv[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
ll C(int x,int y){return frc[x]*inv[y]%mod*inv[x-y]%mod;}
void Solve(){
	int i,j;scanf("%d%d",&n,&k);
	inv[1]=1;for(i=2;i<=k;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(frc[0]=inv[0]=i=1;i<=k;i++) frc[i]=frc[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
	// ll ans=0;
	// for(i=1;i<=n;i++){
	// 	for(j=0;j<=(k-1)/2;j++) ans+=C(k,j)*mpow(i-1,j)%mod*mpow(n-i+1,k-j)%mod;
	// }
	ll ans=mpow(n,k)*(n+1)%mod;
	if(k%2==0){
		for(i=1;i<=n+1;i++) ans-=C(k,k/2)*mpow(i-1,k/2)%mod*mpow(n-i+1,k/2)%mod;
	}
	// for(i=1;i<=n;i++) ans+=mpow(n,k);
	printf("%lld\n",(ans%mod+mod)*inv[2]%mod);
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}