#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;

const ll mod = 998244353;


//累乗 aのb乗、正しmを法として求める
long long pw(long long a,long long b,long long m){
    if(b==0) return 1;
    else if(b%2==0){
        long long x = pw(a,b/2,m);
        return (x*x)%m;
    }
    else{
        long long x = pw(a,b-1,m);
        return (a*x)%m;
    }
}



//mod逆元
long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}


//Combination2
//10^6くらいまで
//modはグローバルに定義しておく

vector<ll> fact;
vector<ll> invf;
ll comb(ll n,ll k){
    if(n<0||k<0||k>n) return 0LL;
    else{
        ll a = fact[n]*invf[k]%mod;
        a = a*invf[n-k]%mod;
        return a;
    }
}
    

int main() {
    ll N,K; cin >> N >> K;
    //main関数内に以下ペースト
    //N:max
    fact.assign(N+1,1LL);
    invf.assign(N+1,1LL);
    rep(i,N) fact[i+1] = fact[i]*(i+1)%mod;
    rep(i,N+1) invf[i] = modinv(fact[i],mod);
    map<ll,ll> cnt; set<ll> app;
    rep(i,N){
        ll b; cin >> b;
        app.insert(b);
        if(cnt.count(b)) cnt[b]++;
        else cnt[b] = 1;
    }
    ll dp[N+1][K+1];
    rep(i,N+1){
        rep(j,K+1) dp[i][j] = 0;
    }
    dp[0][0] = 1;
    rep(i,N){
        rep(j,K+1){
            dp[i][j] %= mod;
            rep(k,N-i){
                if(j+k>K) break;
                dp[i+1][j+k] += dp[i][j];
                dp[i+1][j+k] %= mod;
            }
        }
    }
    ll db[N+1][K+1];
    rep(i,N+1){
        rep(j,K+1) db[i][j] = 0;
    }
    db[0][0] = 1; int j = 0;
    for(ll x:app){
        int t = cnt[x];
        rep(i,t){
            rep(k,K+1){
                rep(m,i+1){
                    if(k+m>K) break;
                    db[j+1][k+m] += db[j][k];
                    db[j+1][k+m] %= mod;
                }
            }
            j++;
        }
    }
    rep(i,K+1){
        rep(j,K+1){
            if(j==0) continue;
            if(i+j>K) break;
            dp[N][i+j] += (mod-(dp[N][i]*db[N][j])%mod);
            dp[N][i+j] %= mod;
        }
    }
    ll ans = dp[N][K];
    cout << ans << endl;
}