import sys
from collections import Counter
readline=sys.stdin.readline

def NTT(polynomial0,polynomial1):
    if mod==998244353:
        prim_root=3
        prim_root_inve=332748118
    else:
        prim_root=Primitive_Root(mod)
        prim_root_inve=MOD(mod).Pow(prim_root,-1)
    def DFT(polynomial,n,inverse=False):
        if inverse:
            for bit in range(1,n+1):
                a=1<<bit-1
                x=pow(prim_root,mod-1>>bit,mod)
                U=[1]
                for _ in range(a):
                    U.append(U[-1]*x%mod)
                for i in range(1<<n-bit):
                    for j in range(a):
                        s=i*2*a+j
                        t=s+a
                        polynomial[s],polynomial[t]=(polynomial[s]+polynomial[t]*U[j])%mod,(polynomial[s]-polynomial[t]*U[j])%mod
            x=pow((mod+1)//2,n,mod)
            for i in range(1<<n):
                polynomial[i]*=x
                polynomial[i]%=mod
        else:
            for bit in range(n,0,-1):
                a=1<<bit-1
                x=pow(prim_root_inve,mod-1>>bit,mod)
                U=[1]
                for _ in range(a):
                    U.append(U[-1]*x%mod)
                for i in range(1<<n-bit):
                    for j in range(a):
                        s=i*2*a+j
                        t=s+a
                        polynomial[s],polynomial[t]=(polynomial[s]+polynomial[t])%mod,U[j]*(polynomial[s]-polynomial[t])%mod

    l=len(polynomial0)+len(polynomial1)-1
    n=(len(polynomial0)+len(polynomial1)-2).bit_length()
    polynomial0=polynomial0+[0]*((1<<n)-len(polynomial0))
    polynomial1=polynomial1+[0]*((1<<n)-len(polynomial1))
    DFT(polynomial0,n)
    DFT(polynomial1,n)
    ntt=[x*y%mod for x,y in zip(polynomial0,polynomial1)]
    DFT(ntt,n,inverse=True)
    ntt=ntt[:l]
    return ntt

N,K=map(int,readline().split())
A=list(map(int,readline().split()))
mod=998244353
C=Counter(A)
DP=[1]
s=0
for a in sorted(list(C.keys())):
    c=C[a]
    dp=[[[0]*(s*c+1) for j in range(c+1)] for i in range(s+1)]
    dp[0][0][0]=1
    for i in range(s+1):
        for j in range(c+1):
            for k in range(s*c+1):
                if i:
                    dp[i][j][k]+=dp[i-1][j][k]
                if j and k-i>=0:
                    dp[i][j][k]+=dp[i][j-1][k-i]
                dp[i][j][k]%=mod
    DP=NTT(DP,dp[-1][-1])
    s+=c
if len(DP)<=K:
    ans=0
else:
    ans=DP[K]
print(ans)