class Combination:

    def __init__(self, MX=10**6, MOD=998244353):
        self.MX = MX
        self.MOD = MOD
        self.fact = [1] * (MX + 1)
        self.inv = [1] * (MX + 1)
        self.f_inv = [1] * (MX + 1)
        for i in range(2, MX + 1):
            self.fact[i] = (self.fact[i - 1] * i) % MOD
            self.inv[i] = ( - (MOD // i) * (self.inv[MOD % i])) % MOD
            self.f_inv[i] = (self.f_inv[i - 1] * self.inv[i]) % MOD
    
    def invs(self, n):
        if n <= self.MX:
            return self.inv[n]
        else:
            return pow(n, self.MOD - 2, self.MOD)
    
    def p(self, n, r):
        if r > n or r < 0:
            return 0
        return (self.fact[n] * self.f_inv[r]) % self.MOD
    
    def c(self, n, r):
        if r > n or r < 0:
            return 0
        return (self.fact[n] * self.f_inv[r] * self.f_inv[n - r]) % self.MOD


MOD = 998244353
C, X = map(int, input().split())
com = Combination(MX=3000)

if X == 0:
    exit(print(com.invs(C + 1) % MOD))
if C >= X:
    exit(print(X * com.invs(X + 1) % MOD))

dp = [[0] * (X + 1) for _ in range(X + 1)]
dp[C][0] = 1
for i in range(X):
    for j in range(1, X + 1):
        dp[i + 1][j] += j * com.invs(i + 1) * dp[i][j]
        dp[i + 1][j] += (i - j + 2) * com.invs(i + 1) * dp[i][j - 1]
        dp[i + 1][j] %= MOD

ans = 0
for i in range(X + 1):
    ans += dp[X][i] * (X - i) * com.invs(X + 1 - i)
    ans %= MOD

print(ans)