#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long modpow(long long a, long long b){
	long long ans = 1;
	while (b > 0){
		if (b % 2 == 1){
			ans *= a;
			ans %= MOD;
		}
		a *= a;
		a %= MOD;
		b /= 2;
	}
	return ans;
}
int main(){
  int N, K;
  cin >> N >> K;
  vector<long long> INV(N + 1);
  INV[1] = 1;
  for (int i = 2; i <= N; i++){
    INV[i] = MOD - INV[MOD % i] * (MOD / i) % MOD;
  }
  vector<vector<long long>> dp(K + 1, vector<long long>(N + 1, 0));
  dp[0][0] = 1;
  for (int i = 0; i < K; i++){
    vector<long long> S(N + 2);
    S[0] = 0;
    for (int j = 0; j <= N; j++){
      S[j + 1] = (S[j] + dp[i][j]) % MOD;
    }
    dp[i + 1][0] = 1;
    for (int j = 1; j <= N; j++){
      dp[i + 1][j] = S[j] * INV[j] % MOD;
    }
  }
  cout << dp[K][N] << endl;
}