#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    constexpr auto inf = INT_MAX / 2;

    int n, m; cin >> n >> m;
    auto a = vec<int>(uns, n);
    for (auto &e : a) cin >> e;
    sort(begin(a), end(a));

    auto dp = vec<int>(inf, m + 1);

    dp[0] = 0;
    for (int i = 1; i <= m; ++i) {
        for (auto v : a) {
            if (0 <= i - v) {
                chmin(dp[i], dp[i - v] + 1);
            }
        }
    }

    auto f = vec<mint>(uns, m + 1);

    f[0] = 1;
    for (int i = 1; i <= m; ++i) {
        f[i] = f[i - 1] * i;
    }

    auto comb = [&](int n, int r) {
        return f[n] / (f[r] * f[n - r]);
    };

    mint ans = 0;
    for (int i = 0; i <= m; ++i) {
        if (m - dp[i] < 0) {
            continue;
        }

        ans += comb(m - dp[i], i - dp[i]);
    }

    cout << ans.val() << endl;
}