MOD = 998244353
n, k = map(int, input().split())
d = [0] * 2 ** 10
for a in map(int, input().split()):
    d[a] += 1
if k > 10:
    print(0)
    exit()
dp = [0] * 2 ** 10
dp[0] = 1
for _ in range(k):
    ndp = [0] * 2 ** 10
    for i in range(2**10):
        for j in range(1, 2**10):
            if i & j:
                continue
            ndp[i|j] += dp[i] * d[j]
            ndp[i|j] %= MOD
    dp = ndp
fact = 1
for x in range(1, k+1):
    fact *= x
    fact %= MOD
ans = sum(dp) * pow(fact, MOD-2, MOD) % MOD
print(ans)