const MOD: usize = 998244353;

fn fact_inv(size: usize) -> (Vec<usize>, Vec<usize>) {
    let mut facts = vec![0usize; size+1];
    let mut fact_invs = vec![0usize; size+1];
    let mut invs = vec![0usize; size+1];
    facts[0] = 1;
    facts[1] = 1;
    fact_invs[0] = 1;
    fact_invs[1] = 1;
    invs[1] = 1;
    for i in 2..=size {
        facts[i] = facts[i-1] * i % MOD;
        invs[i] = MOD - invs[MOD % i] * (MOD / i) % MOD;
        fact_invs[i] = fact_invs[i - 1] * invs[i] % MOD;
    }
    (facts, fact_invs)
}

fn comb(n: usize, r: usize, facts: &Vec<usize>, fact_invs: &Vec<usize>) -> usize {
    facts[n] * fact_invs[r] % MOD * fact_invs[n-r] % MOD
}

fn main() {
    let mut nm = String::new();
    std::io::stdin().read_line(&mut nm).ok();
    let nm: Vec<usize> = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nm[0];
    let m = nm[1];

    if n >= m {
        println!("{}", (1..=m).fold(1usize, |x, y| x * y % MOD));
        return;
    }
    let (facts, fact_invs) = fact_inv(n.max(m) + 10);
    let mut base = vec![m/n; n];
    for i in 0..m%n {
        base[i] += 1;
    }
    let mut result = 1usize;
    let mut rest = m;
    for i in 0..n {
        result *= comb(rest, base[i], &facts, &fact_invs);
        result %= MOD;
        rest -= base[i];
    }
    println!("{}", result);
}