MOD = 998244353
fac = [1] * (1 * 10 ** 6 + 1)
for i in range(len(fac) - 1):
    fac[i + 1] = fac[i] * (i + 1) % MOD

def comb(n, k):
    if k < 0 or n < k:
        return 0
    return fac[n] * pow(fac[n - k] * fac[k], MOD - 2, MOD) % MOD

n, m = map(int, input().split())
ans = 1
c = 0
for i in range(n):
    if i < m % n:
        ans *= comb(m - c, m // n + 1)
        c += m // n + 1
    else:
        ans *= comb(m - c, m // n)
        c += m // n
    ans %= MOD
print(ans)