#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

template<ll Mod>
struct ModInt{
    long long x;
    ModInt():x(0){}
    ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){}
    ModInt &operator+=(const ModInt &p){
        if((x+=p.x)>=Mod) x-=Mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x+=Mod-p.x)>=Mod)x-=Mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x=(int)(1ll*x*p.x%Mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        (*this)*=p.inverse();
        return *this;
    }
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    ModInt inverse()const{
        int a=x,b=Mod,u=1,v=0,t;
        while(b>0){
            t=a/b;
            swap(a-=t*b,b);swap(u-=t*v,v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n)const{
        ModInt ret(1),mul(x);
        while(n>0){
            if(n&1) ret*=mul;
            mul*=mul;n>>=1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
    friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
    static int get_mod(){return Mod;}
};

using mint=ModInt<998244353>;

signed main(){

    int N,K;cin>>N>>K;
    vector<int> A(N);
    cin>>A;
    sort(ALL(A));
    {
        auto B=A;
        B.erase(unique(ALL(B)),end(B));
        for(auto &x:A) x=lower_bound(ALL(B),x)-begin(B);
    }
    // // 要素がuniqueなら解けるんだよなぁ...
    // vector<vector<mint>> dp(N+1,vector<mint>(K+1,0));
    // dp[0][0]=1;
    // rep(i,N){
    //     vector<mint> S(K+2,0);
    //     rep(j,K+1) S[j+1]=S[j]+dp[i][j];

    //     rep(j,K+1) dp[i+1][j]=S[j+1]-S[max(0,j-i)];
    // }
    // cout<<dp[N][K]<<endl;

    // naive
    vector<vector<mint>> dp(K+1,vector<mint>(1,0));
    dp[0][0]=1;

    rep(i,N){
        vector<vector<mint>> ndp(K+1,vector<mint>(i+2,0));


        // i個すでに置いてる
        rep(j,K+1)rep(k,(int)dp[0].size()){
            for(int pos=0;pos<=i;pos++){
                if(j+i-pos<=K){
                    if(pos<=k){
                        if(i==0 or A[i]!=A[i-1]) ndp[j+i-pos][pos]+=dp[j][k];
                    }
                    else ndp[j+i-pos][pos]+=dp[j][k];
                }
            }
        }
        dp=move(ndp);
    }

    mint res=0;
    rep(i,N) res+=dp[K][i];
    cout<<res<<endl;
    return 0;
}