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

const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

int main(){
    int n,k;
    cin>>n>>k;
    vector<int> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    sort(a.begin(),a.end());
    vector<vector<mint>> dp(n+1,vector<mint>(n*(n-1)/2+1,0));
    dp[0][0] = 1;
    int cur = 0;
    for(int i = 0;i<n;){
        int ni = lower_bound(a.begin(),a.end(),a[i]) - a.begin();
        int nj = upper_bound(a.begin(),a.end(),a[i]) - a.begin();
        int now = nj - ni;
        int nn = i;
        int mx = nn * now;
        if(i==0){
            i = nj;
            continue;
        }
        i = nj;
        vector<vector<vector<mint>>>cnt(nn+2,vector<vector<mint>>(now+1,vector<mint>(mx+1,0)));
        cnt[0][0][0] = 1;
        for(int j = 0;j<=nn;j++){
            for(int l = now;l>=0;l--){
                //for(int m = 0;m<=mx;m++) cnt[j+1][l][m] += cnt[j][l][m];
                for(int m = now;m>=0;m--){
                    if(m+l>now) continue;
                    for(int kk = mx;kk>=0;kk--)if(kk+m*j<=mx) cnt[j+1][m+l][kk+m*j] += cnt[j][l][kk];
                }
            }
        }
        for(int kk = 0;kk<=k;kk++){
            for(int j = 0;j<=mx;j++){
                if(kk+j>k) continue;
                dp[cur+1][kk+j] += dp[cur][kk]*cnt[nn+1][now][j];
            }
        }
        cur++;
    }
    cout<<dp[cur][k]<<endl;
}