#include<bits/stdc++.h>
#include<atcoder/all>
#define int long long
using namespace std;
constexpr int mod=998244353;
signed main(){
    int N,K; cin>>N>>K;
    map<int,int> mp;
    for(int i=0;i<N;i++){
        int a; cin>>a;
        mp[a]++;
    }
    int M=mp.size();
    vector<vector<int>> dp(N+1,vector<int>(K+1));
    dp[0][0]=1;
    int sum=0;
    vector<int> B;
    for(auto[a,b]:mp)B.push_back(b);
    reverse(B.begin(),B.end());
    for(int b:B){
        vector<vector<vector<int>>> dp2(b+1,vector<vector<int>>(sum+1,vector<int>(K+1)));
        dp2[0][0][0]=1;
        for(int i=0;i<b;i++){
            for(int j=0;j<=sum;j++){
                for(int k=0;k<=K;k++){
                    if(k+j<=K)(dp2[i+1][j][k+j]+=dp2[i][j][k])%=mod;
                    if(j && k+1<=K)(dp2[i+1][j][k+1]+=dp2[i+1][j-1][k])%=mod;
                }
            }
        }
        vector<int> A(K+1);
        for(int i=0;i<=K;i++){
            for(int j=0;j<=sum;j++)(A[i]+=dp2[b][j][i])%=mod;
        }
        vector<int> C=atcoder::convolution(A,dp[sum]);
        for(int i=0;i<=K;i++)dp[sum+b][i]=C[i];
        sum+=b;
    }
    cout<<dp[N][K]<<endl;
}