#include <bits/stdc++.h>
using namespace std;
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//*/
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
ll mypowl(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}

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

  vector dp(K + 1, vector(N + 1, mint(0)));
  vector dps(K + 1, vector(N + 1, mint(0)));
  dp.at(0).at(0) = 1;
  fill(dps.at(0).begin(), dps.at(0).end(), 1);
  for (ll k = 1; k <= K; k++)
  {
    dp.at(k).at(0) = 1;
    for (ll n = 1; n <= N; n++)
    {
      dp.at(k).at(n) = dps.at(k - 1).at(n - 1) / mint(n);
    }

    dps.at(k).at(0) = 1;
    for (ll n = 1; n <= N; n++)
    {
      dps.at(k).at(n) = dps.at(k).at(n - 1) + dp.at(k).at(n);
    }
  }
  mint ans = dp.at(K).at(N);
  cout << ans.val() << endl;
}