mod = 998244353

memo = [[[-1] * 101 for _ in range(2501)] for _ in range(101)]

def f(n, m, k) -> int:
    if memo[n][m][k] != -1:
        return memo[n][m][k]
    if n == 0:
        if m == 0:
            memo[n][m][k] = 1
            return 1
        else:
            memo[n][m][k] = 0
            return 0
    if n * k < m:
        memo[n][m][k] = 0
        return 0
    memo[n][m][k] = f(n - 1, m, k)
    if m - n >= 0 and k > 0:
        memo[n][m][k] += f(n, m - n, k - 1)
        if memo[n][m][k] >= mod:
            memo[n][m][k] -= mod
    return memo[n][m][k]


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, l, cursum) * dp[i - 1][j - l]
            if dp[i][j] >= mod:
                dp[i][j] %= mod
    cursum += x

print(dp[n][k])