mod = 998244353
N = 10 ** 7 + 2
F = [1] * N
E = [1] * N
for i in range(2, N):
    F[i] = F[i-1]*i%mod
E[-1] = pow(F[-1], -1, mod)
for i in range(N-1, 0, -1):
    E[i-1] = E[i]*i%mod

def comb(a, b): #組合せ
    if b < 0:
        return 0
    if a < b:
        return 0
    return F[a] * E[b] * E[a-b] % mod

def perm(a, b): #順列組み合わせ
    if a < b:
        return 0
    return F[a] * E[a-b] % mod

n, m = map(int, input().split())
if n == 1:
    ans = m * (m-1) // 2
    ans = ans * pow(m, -1, mod) % mod
    print(ans)
else:
    t = 1
    ans = 0
    all = comb(m+n, m)
    all -= n
    bad = pow(all, -1, mod)
    while t * n <= m:
        tmp = 0
        for a in range(n, 0, -1):
            amari = m - t * n - (n - a)
            tmp += comb(n, a) * comb(amari+n-a, amari) % mod
            tmp %= mod
        ans += tmp * t * bad
        ans %= mod
        t += 1
    
    print(ans)