#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
mint subdp[101][101][5005];
void calc() {
	subdp[0][0][0] = 1;
	rep(i, 101)rep(j, 101)rep(k, 5001) {
		if ((j >= 1) && (k >= i))subdp[i][j][k] += subdp[i][j - 1][k - i];
		if (i >= 1)subdp[i][j][k] += subdp[i - 1][j][k];
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	map<int, int>mp;
	rep(i, n) {
		int a; cin >> a;
		mp[a]++;
	}
	vector<int>va;
	for (auto p : mp) va.push_back(p.second);
	vector<vector<mint>> dp(va.size() + 1, vector<mint>(5000, 0));
	dp[0][0] = 1;
	int sum = 0;
	calc();
	rep(i, va.size()) {
		rep(j, 5000) {
			rep(k, sum*va[i] + 1) {
				if (j + k >= 5000)continue;
				dp[i + 1][j + k] += dp[i][j] * subdp[sum][va[i]][k];
			}
		}
		sum += va[i];
	}
	cout << dp[va.size()][k].val() << endl;
	return 0;
}