// #define _GLIBCXX_DEBUG #include using namespace std; #include using namespace atcoder; using ll = long long; using vi = vector; using vvi = vector>; using pii = pair; #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define repr(i, n) for (int i = (int)(n - 1); i >= 0; --i) using mint = modint998244353; int main() { int c, x; cin >> c >> x; if (x == 0) { cout << mint(c + 1).inv().val() << endl; } else { c = min(c, x); vector> dp(x + 1, vector(x + 1, 0)); dp[c][0] = 1; for (int k = c + 1; k <= x; k++) { mint kinv = mint(k).inv(); repr(i, x) { dp[k][i] += dp[k - 1][i] * i * kinv; dp[k][i + 1] += dp[k - 1][i] * (k - i) * kinv; } } mint ret = 1; rep(i, x + 1) ret -= dp[x][i] / (x + 1 - i); cout << ret.val() << endl; } return 0; }