mod = 998244353

f = [[[0] * 2501 for _ in range(101)] for _ in range(101)]

for i in range(101):
    f[0][i][0] = 1

for n in range(1, 101):
    for k in range(101):
        for m in range(2501):
            if n * k < m:
                break
            f[n][k][m] += f[n - 1][k][m]
            if m - n >= 0 and k > 0:
                f[n][k][m] += f[n][k - 1][m - n]
                if f[n][k][m] >= mod:
                    f[n][k][m] -= mod

t, k = map(int, input().split())
a = list(map(int, input().split()))
if k > t * (t - 1) // 2:
    print(0)
    exit()

a.sort()
cnt = [0] * 100
n = 0
for i in range(t - 1):
    cnt[n] += 1
    if a[i] != a[i + 1]:
        n += 1

cnt[n] += 1
n += 1

dp = [[0] * 5000 for _ in range(n + 1)]
dp[0][0] = 1

cursum = 0

for i in range(1, n + 1):
    x = cnt[i - 1]
    for j in range(5000):
        for l in range(cursum * x + 1):
            if j - l < 0:
                break
            dp[i][j] += f[x][cursum][l] * dp[i - 1][j - l]
            if dp[i][j] >= mod:
                dp[i][j] %= mod
    cursum += x

print(dp[n][k])