N, M = map(int, input().split())
mod = 998244353
L = [M//N] * N
for i in range(M % N):
    L[i] += 1

n = 505050

fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod

ans = 1
for a in L:
    ans *= comb(M, a)
    M -= a
    ans %= mod

print(ans)