#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
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 c, x;
  cin >> c >> x;
  if (x == 0) {
    cout << mint(c + 1).inv().val() << '\n';
    return 0;
  }
  vector<mint> dp(x + 1);
  dp[0] = 1;
  for(int i = 1; c + i <= x; i++) {
    int cnt = c + i;
    mint cinv = mint(cnt).inv();
    vector<mint> ndp(x + 1);
    rep(j, x) {
      mint v = dp[j];
      if (!v.val()) continue;
      ndp[j] += j * cinv * v;
      if (j + 1 <= x) {
        ndp[j+1] += (cnt - j) * cinv * v;
      }
    }
    swap(dp, ndp);
  }
  mint ans;
  rep(i, x + 1) ans += dp[i] / (x + 1 - i);
  ans = 1 - ans;
  cout << ans.val() << '\n';
}