def f(m, m2):
    return m * M2 + m2

N, K = map(int, input().split())
A = list(map(int, input().split()))
mod = 998244353
M = 11
M2 = 1 << M
if K >= M:
    print(0)
    exit()
D = [0] * M2
for a in A:
    D[a] += 1

ans = 0
dp = [0] * (M2 * (M + 1))
dp[0] = 1
for s in range(M2):
    for t in range(s, M2):
        for i in range(M):
            if s + t == s ^ t:
                dp[f(i + 1, s + t)] += dp[f(i, s)] * D[t]
                dp[f(i + 1, s + t)] %= mod

for i in range(M2):
    ans += dp[f(K, i)]
    ans %= mod

print(ans)