const INF: usize = 1usize << 60;
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];
    let mut a = String::new();
    std::io::stdin().read_line(&mut a).ok();
    let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();

    let mut dp = vec![vec![INF; m+1]; n+1];
    dp[0][0] = 0;
    for i in 0..n {
        for j in 0..=m {
            dp[i+1][j] = dp[i+1][j].min(dp[i][j]);
            if j+a[i] <= m {
                dp[i+1][j+a[i]] = dp[i+1][j+a[i]].min(dp[i][j] + 1);
            }
            if j >= a[i] {
                dp[i+1][j] = dp[i+1][j].min(dp[i+1][j-a[i]] + 1);
            }
        }
    }
    let (facts, fact_invs) = fact_inv(m+10);
    let mut result = 1usize;
    for i in 1..=m {
        if dp[n][i] == INF { continue; }
        result += comb(m-dp[n][i], i-dp[n][i], &facts, &fact_invs);
        result %= MOD;
    }
    println!("{}", result);
}