#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<ll,ll>;
using V=vector<ll>;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)

ll p=998244353,siz=2*1e5;
V a(siz),b(siz);

ll powk(ll k,ll n){
    ll ans=1,m=k%p;
    if(m==0) return 0;
    while(n){
        if(n%2) ans=ans*m%p;
        m=m*m%p; n/=2;
    }
    return ans;
}

void comb1(){
    a[0]=1;
    for(ll i=1;i<siz;i++) a[i]=a[i-1]*i%p;
    rep(i,siz) b[i]=powk(a[i],p-2);
    return;
}

ll comb(int n,int k){
    return a[n]*b[n-k]%p*b[k]%p;
}

int main(){
    comb1();
    ll n,k;
    cin >> n >> k;
    
    ll ans=0;
    rep(i,n){
        ans+=powk(i,k)*comb(n-1,i);
        ans%=p;
    }
    cout << ans << endl;

}