from collections import Counter

N,K=map(int,input().split())
A=list(map(int,input().split()))
mod=998244353
M=10
K=min(K,M+1)
C=Counter(A)
dp=[[0]*(1<<M) for k in range(K+1)]
dp[0][0]=1
for a,c in C.items():
    prev=dp
    dp=[[0]*(1<<M) for k in range(K+1)]
    for bit in range(1<<M):
        for k in range(K+1):
            dp[k][bit]+=prev[k][bit]
            dp[k][bit]%=mod
        if bit&a:
            continue
        for k in range(K):
            dp[k+1][bit|a]+=prev[k][bit]*c%mod
            dp[k+1][bit|a]%=mod
ans=sum(dp[K])%mod
print(ans)