import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.buffer.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def cmb(n, r, mod):
    if ( r<0 or r>n ):
        return 0
    return (g1[n] * g2[r] % mod) * g2[n-r] % mod

mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)

for i in range( 2, N + 1 ):
    g1[i]=( ( g1[i-1] * i ) % mod )
    inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
    g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0

C,X = mi()

if X == 0:
    print(inverse[C+1])
    exit()

dp = [0] * (X+1)
dp[0] = 1
for i in range(X-C):
    ndp = [0] * (X+1)
    for j in range(X+1):
        ALL = C+i+1
        NEW = ALL - j
        if j!=X:
            ndp[j+1] += dp[j] * NEW * inverse[ALL] % mod
            ndp[j+1] %= mod
        ndp[j] += dp[j] * (j) * inverse[ALL] % mod
        ndp[j] %= mod
    dp = ndp

res = 0
for j in range(X+1):
    rest = X+1 - j
    res += dp[j] * (1 - inverse[rest]) % mod
    res %= mod

print(res)