#include <stdio.h>

const int Mod = 998244353;

void merge_sort(int x[], int n)
{
	static int y[101] = {};
	if (n <= 1) return;
	merge_sort(&(x[0]), n/2);
	merge_sort(&(x[n/2]), (n+1)/2);
	
	int i, p, q;
	for (i = 0, p = 0, q = n/2; i < n; i++) {
		if (p >= n/2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int memo[101][101][10001];

int recursion(int N, int M, int S)
{
	if (memo[N][M][S] >= 0) return memo[N][M][S];
	else if (N * M < S) {
		memo[N][M][S] = 0;
		return memo[N][M][S];
	}
	
	int i, j, k;
	long long ans = 0;
	for (i = 0; i <= M && i <= S; i++) ans += recursion(N - 1, i, S - i);
	memo[N][M][S] = ans % Mod;
	return memo[N][M][S];
}

int main()
{
	int i, N, K, A[101];
	scanf("%d %d", &N, &K);
	for (i = 0; i < N; i++) scanf("%d", &(A[i]));
	merge_sort(A, N);
	
	int j, k = 0, l, num[101] = {};
	for (i = 0, k = 0; i < N; i = j, k++) {
		for (j = i + 1; j < N && A[j] == A[i]; j++);
		num[k] = j - i;
	}
	for (i = 1; i <= N; i++) for (j = 0; j <= N; j++) for (l = 0; l <= N * N; l++) memo[i][j][l] = -1;
	for (j = 0; j <= N; j++) for (l = 1, memo[0][j][0] = 1; l <= N * N; l++) memo[0][j][l] = 0;

	int sum = num[0];
	long long dp[101][5001] = {};
	for (i = 1, dp[0][0] = 1; i < k; i++) {
		if (num[i] == 0) continue;
		for (j = sum * (sum - 1) / 2; j >= 0; j--) {
			dp[i-1][j] %= Mod;
			for (l = 0; l <= sum * num[i]; l++) dp[i][j+l] += dp[i-1][j] * recursion(num[i], sum, l) % Mod;
		}
		sum += num[i];
	}
	printf("%lld\n", dp[k-1][K] % Mod);
	fflush(stdout);
	return 0;
}