#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
    }
} __Setup;

using ll = long long;
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) ((int)(v).size())
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

void Case(int i) { cout << "Case #" << i << ": "; }
int popcount(int x) { return __builtin_popcount(x); }
ll popcount(ll x) { return __builtin_popcountll(x); }
#pragma endregion Macros

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

// pre[i][j][k] = {0,1,...,i}からj個重複を許して選び和がkになる通り数
mint pre[101][101][10001];
mint dp[101][10001];

int main() {
    int N, K;
    cin >> N >> K;
    map<int, int> comp;
    REP(i, N) {
        int a;
        cin >> a;
        comp[a]++;
    }
    vector<int> a;
    for(auto [k, v] : comp) a.emplace_back(v);
    
    pre[0][0][0] = 1;
    REP(i, 101) {
        REP(j, 101) {
            REP(k, i * j + 1) {
                if(i-1 >= 0) {
                    pre[i][j][k] += pre[i-1][j][k];
                }
                if(j-1 >= 0 and k-i >= 0) {
                    pre[i][j][k] += pre[i][j-1][k-i];
                }
            }
        }
    }
    debug(pre[2][2][2].val());

    dp[0][0] = 1;
    int sumc = 0;
    int n = SZ(a);
    REP(i, 1, n+1) {
        int cnt = a[i-1];
        REP(j, N*N+1) {
            REP(k, min(cnt*sumc, j)+1) {
                dp[i][j] += dp[i-1][j-k] * pre[sumc][cnt][k];
            }
        }
        sumc += cnt;
    }
    cout << dp[n][K].val() << endl;
}