#define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<string>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<random>
#include<bitset>
#include<cassert>
#include<complex>
#include<fstream>
#include<cstdlib>
#include<functional>
#include<array>
using namespace std;
typedef long long ll;
const int mod=998244353;
const int dx[]={1,0,0,-1},dy[]={0,1,-1,0};
ll fact[200001],invfac[200001];
ll mypow(int x,ll n){
	if(n==0)
		return 1;
	if(n%2==1)
		return mypow(x,n-1)*x%mod;
	ll res=mypow(x,n/2);
	return res*res%mod;
}
ll inv(int x){
	return mypow(x,mod-2);
}
ll comb(int n,int r){
	if(!(0<=r&&r<=n))
		return 0;
	return fact[n]*invfac[r]%mod*invfac[n-r]%mod;
}
int main(){
	fact[0]=1;
	for(int i=1;i<=200000;i++)
		fact[i]=i*fact[i-1]%mod;
	for(int i=0;i<=200000;i++)
		invfac[i]=inv(fact[i]);
	int n,k;
	cin>>n>>k;
	int ans=0;
	for(int i=0;i<n;i++)
		ans=(ans+comb(n-1,i)*mypow(i,k))%mod;
	cout<<ans<<endl;
}