rt

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod (int)998244353
int a,b,ans;
int wop(int x,int k){//快速幂
	int t=1;
	while(k){
		if(k%2){
			t=t*x%mod;
		}
		k/=2;
		x=x*x%mod;
	}
	return t;
}
int n,k,f[100005][2];
signed main(){
    cin>>n>>k;
	f[0][0]=1;
    for(int i=1;i<=k;i++){
        f[i][0]=(f[i-1][0]*(1+wop(n-1,2))%mod+f[i-1][1]*2)%mod;
        f[i][1]=((wop(n,2*i)-f[i][0])%mod+mod)%mod;
    }
	cout<<(f[k][0]+(n+2)*f[k][1]/2)%mod*wop(wop(n,2*k),mod-2)%mod;
	return 0;
}