#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
typedef long long ll;

ll my_pow(ll x, ll n, ll mod){
    //　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0){
        ret = 1;
    }
    else if (n % 2 == 1){
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    }
    else{
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

int main(){
    ll N,K;
    cin >> N >> K;
    vector<ll> inverse(5005);
    for (ll i = 1; i < 5005; i++){
        ll x = my_pow(i, mod2 - 2, mod2);
        inverse[i] = x;
    }

    vector<vector<ll>> dp(K + 1, vector<ll>(N + 1, 0));
    dp[0][0] = 1;
    for (ll i = 0; i < K; i++){
        for (ll j = 0; j < N; j++){
           dp[i + 1][j + 1] = (dp[i + 1][j + 1] + ((dp[i][j] * inverse[N - j]) % mod2)) % mod2;
        }
        for (ll j = 0; j < N; j++){
            dp[i + 1][j + 1] = (dp[i + 1][j + 1] + dp[i + 1][j]) % mod2;
        }
    }
    /*for (ll i = 0; i <= K; i++){
        for (ll j = 0; j <= N; j++){
            cout << dp[i][j] << " ";
        }
        cout << endl;
    }*/
    ll ans = 0;
    for (ll i = 0; i <= K; i++){
        ans = (ans + dp[i][N] + mod2) % mod2;
    }
    cout << ans << endl;
}