n, k = map(int, input().split())
A = list(map(int, input().split()))
mod = 998244353

D = [[] for _ in range(10)]
for i in range(n):
    ai = A[i]
    for j in range(10):
        if ai % 2 == 1:
            D[j].append(i)
        ai //= 2

fact = [1] * (n + 1)
inv = [1] * (n + 1)
finv = [1] * (n + 1)
for i in range(2, n + 1):
    fact[i] = fact[i - 1] * i % mod
    inv[i] = mod - inv[mod % i] * (mod // i) % mod
    finv[i] = finv[i - 1] * inv[i] % mod
def comb(x, y):
    if x < y:
        return 0
    return fact[x] * finv[y] % mod * finv[x - y] % mod

ans = comb(n, k)
for i in range(10):
    ans -= comb(len(D[i]), k)
    ans %= mod
print(ans)