#include <stdio.h>
#include <algorithm>
#include <vector>
#include <set>

long long inv(long long a, long long mod){
    long long s = 1, tmp = a, t = mod - 2;
    while(t > 0){
        if(t % 2 == 1){
            s *= tmp;
            s %= mod;
        }
        t /= 2;
        tmp *= tmp;
        tmp %= mod;
    }
    return s;
}

int main() {
    int n, m; scanf("%d %d", &n, &m);
    std::vector<long long> v(n);
    for(int i = 0; i < n; ++i) {
        scanf("%ld", &v[i]);
    }
    long long ans = 1, MOD = 998244353;
    std::vector<std::set<int>> s(n+1); s[0].insert(0);
    std::vector<long long> fac(m+1); fac[0] = 1;
    for(int i = 1; i <= m; ++i) {
        fac[i] = fac[i-1] * i % MOD;
    }
    for(int i = 1; i <= n; ++i) {
        for(int tmp: s[i-1]) {
            for(int j = 0; j < n; ++j) {
                if(tmp + v[j] <= m) s[i].insert(tmp + v[j]);
            }
        }
        for(int tmp: s[i]) {
            ans += fac[m-i] * inv(fac[tmp-i], MOD) % MOD * inv(fac[m-tmp], MOD) % MOD;
            ans %= MOD;
            // printf("%ld ", fac[m-i] * inv(fac[tmp-i], MOD) % MOD * inv(fac[m-tmp], MOD) % MOD);
        }
        // printf("%ld\n", ans);
    }
    for(int i = 1; i < n; ++i) {
        for(int j = i+1; j <= n; ++j) {
            std::set<int> mul;
            std::set_intersection(s[i].begin(), s[i].end(),
                                  s[j].begin(), s[j].end(),
                                  std::inserter(mul, mul.end()));
            for(int tmp: mul) {
                ans += MOD;
                ans -= fac[m-j] * inv(fac[tmp-j], MOD) % MOD * inv(fac[m-tmp], MOD) % MOD;
                ans %= MOD;
            }
        }
    }
    printf("%ld\n", ans);
    return 0;
}