#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/modint>
#include <atcoder/convolution>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using mint = atcoder::modint998244353;

ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k; cin >> n >> k;
    map<int, int> cnt;
    for(int i = 0; i < n; i++){
        int x; cin >> x;
        if(cnt.count(x)) cnt[x]++;
        else cnt[x] = 1;
    }
    int sum = 0;
    vector<mint> ans = {mint(1)};
    for(auto [x, c]: cnt){
        auto dp = vec3d(c+1, sum+1, sum*c+1, mint(0));
        dp[0][0][0] = 1;
        for(int i = 0; i < c; i++){
            for(int j = 0; j <= sum; j++){
                for(int k = 0; k <= sum*c; k++){
                    for(int l = j; l <= sum && k+l <= sum*c; l++){
                        dp[i+1][l][k+l] += dp[i][j][k];
                    }
                }
            }
        }
        vector<mint> u(sum*c+1);
        for(int j = 0; j <= sum; j++){
            for(int k = 0; k <= sum*c; k++){
                u[k] += dp[c][j][k];
            }
        }
        ans = atcoder::convolution(ans, u);
        sum += c;
    }
    if(ans.size() <= k) cout << 0 << endl;
    else cout << ans[k] << endl;
}