#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

mint dp0[101][10010];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    for(int s = 0; s <= 100; s++) for(int cnt = 0; cnt <= 100; cnt++) {
    }
    int n, k;
    cin >> n >> k;
    map<int, int> hist;
    rep(i, n) {
        int a;
        cin >> a;
        hist[a]++;
    }
    int s = 0;
    vector<mint> dp(k + 1);
    dp[0] = 1;
    for(auto [_, cnt]: hist) {
        for(int i = cnt; i >= 0; i--) for(int j = k; j >= 0; j--) {
            dp0[i][j] = 0;
        }
        dp0[0][0] = 1;
        for(int r = 0; r <= s; r++) for(int i = cnt; i >= 0; i--) for(int j = k; j >= 0; j--) {
            mint now = dp0[i][j];
            if (now == 0) continue;
            dp0[i][j] = 0;
            for(int ni = i; ni <= cnt; ni++) {
                int add = ni - i;
                dp0[ni][j + r * add] += now;
            }
        }
        for(int i = k; i >= 0; i--) {
            mint now = dp[i];
            dp[i] = 0;
            for(int j = k - i; j >= 0; j--) dp[i + j] += now * dp0[cnt][j];
        }
        s += cnt;
    }
    cout << dp[k].val() << endl;
}