#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<vector<mint>> f(n);
  f[0] = {0, 1};
  for (int i = 1; i < n; i++) {
    vector<mint> g{1};
    rep(j, i) {
      auto fj = f[j];
      fj[0]++;
      g = convolution(fj, g);
      if (ssize(g) >= m + 1) g.resize(m + 1);
    }
    g.insert(g.begin(), 0);
    f[i] = g;
  }
  vector<mint> g{1};
  rrep(i, n) {
    auto fi = f[i];
    fi[0]++;
    g = convolution(g, fi);
    if (ssize(g) >= m + 1) g.resize(m + 1);
  }
  // rep(i, n) {
  //   for (auto x : f[i]) cout << x.val() << ' ';
  //   cout << endl;
  // }
  g.resize(m + 1);
  cout << g[m].val() << '\n';
}