#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

constexpr ll mod = 998244353;

ll mod_pow(ll a,ll b){
    a%=mod;
    if(b==0)return 1;
    if(b==1)return a;
    ll res=mod_pow(a,b/2)%mod;
    res*=res; res%=mod;
    if(b%2)res*=a;
    return res%mod;
}

int dp[2001][2001];

void add(int &x,int y){
    x += y;
    if(x >= mod) x -= mod;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k; cin >> n >> k;
    dp[0][0] = 1;

    vector<ll> inv(n+1);
    for(int i=1;i<=n;i++){
        inv[i] = mod_pow(i,mod-2);
    }
    for(int i=0;i<k;i++){
        int sum = 0;
        for(int j=0;j<=n;j++){
            add(dp[i+1][j],sum);
            if(!dp[i][j])continue;
            add(sum,inv[n-j]*(ll)dp[i][j]%mod);
        }
    }
    int res = 0;
    for(int i=1;i<=k;i++){
        add(res,dp[i][n]);
    }
    cout << res << endl;
}