#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
const unsigned int MOD = 998244353;
int N,K;
vector<int> A;
vector<int> C;
vector<int> dp;

int main(void){
    // Your code here!
    cin >> N >> K;
    A.resize(N);
    rep(i,N) cin >> A[i];
    sort(A.begin(),A.end());
    C.push_back(1);
    rep(i,N-1) if(A[i] == A[i+1]) C.back()++; else C.push_back(1);
    
    dp.resize(K+1);
    dp[0] = 1;
    for (int c = 1; c < N+1; c++) {
        for (int i = K-c; i >= 0; i--) {
            dp[i+c] -= dp[i];
            if (dp[i+c] < 0) dp[i+c] += MOD;
        }
    }
    
    for (auto m: C){
        for (int c = 1; c < m+1; c++) {
            for (int i = 0; i < K+1-c; i++) {
                dp[i+c] = (dp[i+c]+dp[i])%MOD;
                if (dp[i+c] >= MOD) dp[i+c] -= MOD;
            }
        }
    }
    int v = dp[K];
    if (v < 0) v += MOD;
    cout << v << endl;
}