#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
	lint N, K;
	cin >> N >> K;

	lint a=0, b=0, c=0, x, y, z;
	vm d(N+1);
	repx(i, 1, N+1) d[i] = (mint)1/i;
	std::vector<vm> dp(K+1, vm(N+1));
	dp[0][0] = 1;
	rep(i, K) {
		vm t(N+1);
		rep(j, N) {
			t[j] = dp[i][j]*d[N-j];
		}
		rep(j, N) {
			t[j+1] += t[j];
		}
		repx(j, 1, N+1) {
			dp[i+1][j] += t[j-1];
		}
		dp[i+1][N] += dp[i][N];
	}
	std::cout << dp[K][N].val() << '\n';
}