mod = 998244353

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

if M == 0:
    print(1 % mod)
else:
    max_fact = M
    # Precompute factorial and inverse factorial modulo
    fact = [1] * (max_fact + 1)
    for i in range(1, max_fact + 1):
        fact[i] = fact[i-1] * i % mod
    
    inv_fact = [1] * (max_fact + 1)
    inv_fact[max_fact] = pow(fact[max_fact], mod - 2, mod)
    for i in range(max_fact - 1, -1, -1):
        inv_fact[i] = inv_fact[i+1] * (i+1) % mod
    
    q = M // N
    r = M % N
    
    part1 = pow(inv_fact[q], N - r, mod)
    if r == 0:
        part2 = 1
    else:
        part2 = pow(inv_fact[q + 1], r, mod)
    
    denominator_inv = (part1 * part2) % mod
    ans = (fact[M] * denominator_inv) % mod
    print(ans)