use std::io::*;

use crate::enumeration::Enumeration;
const MOD: u64 = 998244353;
const INF: usize = 1 << 60;

mod enumeration {
    pub struct Enumeration {
        fact: Vec<u64>,
        finv: Vec<u64>,
        modulo: u64,
    }
    impl Enumeration {
        pub fn new(n: usize, modulo: u64) -> Enumeration {
            let mut fact: Vec<u64> = vec![1; n];
            let mut inv: Vec<u64> = vec![1; n];
            let mut finv: Vec<u64> = vec![1; n];
            for i in 2..n {
                fact[i] = fact[i - 1] * (i as u64) % modulo;
                inv[i] = modulo - (modulo / (i as u64)) * inv[(modulo as usize % i)] % modulo;
                finv[i] = inv[i] * finv[i - 1] % modulo;
            }
            Enumeration {
                fact: fact,
                finv: finv,
                modulo: modulo,
            }
        }
        pub fn c(&self, n: usize, k: usize) -> u64 {
            if n < k {
                return 0;
            }
            self.fact[n] * self.finv[n - k] % self.modulo * self.finv[k] % self.modulo
        }
    }
}
fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let n: usize = itr.next().unwrap().parse().unwrap();
    let m: usize = itr.next().unwrap().parse().unwrap();
    let a: Vec<usize> = (0..n)
        .map(|_| itr.next().unwrap().parse().unwrap())
        .collect();

    let e = Enumeration::new(m + 1, MOD);
    let mut dp = vec![INF; m + 1];
    dp[0] = 0;
    for i in 0..m {
        for j in 0..n {
            if i + a[j] <= m {
                dp[i + a[j]] = std::cmp::min(dp[i + a[j]], dp[i] + 1);
            }
        }
    }
    let mut ans = 0u64;
    for i in 0..=m {
        if dp[i] != INF {
            ans = (ans + e.c(m - dp[i], i - dp[i])) % MOD;
        }
    }
    println!("{}", ans);
}