#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

ll power(ll x, ll y){
    x%=MOD;
    ll ret=1;
    while(y){
        if(y&1) ret=ret*x%MOD;
        x=x*x%MOD;
        y>>=1;
    }
    return ret;
}

ll divid(ll x, ll y){
    x%=MOD;
    return x*power(y,MOD-2)%MOD;
}

int main(){
    int n, k; cin >> n >> k;
    VVI dp(k+1,VI(n+1,0));
    dp[0][0]=1;
    ll ans=0;
    REP(i,k){
        ll sum=0;
        REP(j,n+1){
            dp[i+1][j]=sum;
            sum=(sum+divid(dp[i][j],n-j))%MOD;
        }
        ans=(ans+dp[i+1][n])%MOD;
    }
    cout << ans << endl;
    return 0;
}