def factorial(n):
    F = [1]
    for i in range(1, n+1):
        F.append(F[-1]*i%MOD)
    invF = [pow(F[-1], -1, MOD)]
    for i in reversed(range(n)):
        invF.append(invF[-1]*(i+1)%MOD)
    invF = invF[::-1]
    return F, invF

MOD = 998244353
F, invF = factorial(10**6)

N, M = map(int, input().split())

ans = F[M]
for i in range(N):
    cnt = M//N
    if i < M%N:
        cnt += 1
    ans *= invF[cnt]
    ans %= MOD

print(ans)