#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

long long modpow(long long a,long long b) {
    long long ans = 1;
    while(b) {
        if(b & 1) {
            (ans *= a) %= mod;
        }
        (a *= a) %= mod;
        b /= 2;
    }
    return ans;
}

int dp[2002][2002];

int main() {
    int N,K;
    cin >> N >> K;
    vector<int>tmp(N+1);
    for(int i = 1; i <= N; i++) {
        tmp[i] = modpow(i,mod-2);
    }
    dp[K][N] = 1;
    for(int i = K-1; i >= 0; i--) {
        dp[i][N] = 1;
        int sum = 1;
        for(int j = N-1; j >= 0; j--) {
            dp[i][j] = 1ll*sum*tmp[N-j]%mod;
            sum += dp[i+1][j];
            if(sum >= mod) sum -= mod;
        }
    }
    cout << dp[0][0] << endl;
}