MOD = 998244353

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    M = int(input[1])
    
    max_fact = M  # since n can be up to M when k=0
    # Precompute factorials and inverse factorials up to max_fact
    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
    
    K = M // N
    ans = 0
    for k in range(0, K + 1):
        n = M - k * (N - 1)
        # compute C(n, k)
        if k > n:
            comb = 0
        else:
            comb = fact[n] * inv_fact[k] % MOD
            comb = comb * inv_fact[n - k] % MOD
        ans = (ans + comb) % MOD
    print(ans)

if __name__ == "__main__":
    main()