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

if k > 10:
    print(0)
    exit()

DP = [[0 for _ in range(k + 1)] for _ in range(1 << 10)]
for i in range(n):
    DP[A[i]][1] += 1
for i in range(2, k + 1):
    for bit1 in range(1 << 10):
        for bit2 in range(bit1, 1 << 10):
            if bit1 ^ bit2 == bit1 | bit2:
                nbit = bit1 | bit2
                DP[nbit][i] += DP[bit1][i - 1] * DP[bit2][1] % mod
                DP[nbit][i] %= mod
ans = 0
for i in range(1 << 10):
    ans += DP[i][k]
    ans %= mod
print(ans)