import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

def hadamard(ori):
    aa=ori[:]
    k = 1
    while k < len(aa):
        for i in range(len(aa)):
            if i & k==0: aa[i], aa[i|k] = (aa[i]+aa[i|k])%md, (aa[i]-aa[i|k])%md
        k <<= 1
    return aa

def xor_convolution(aa, bb):
    n = len(aa)
    assert n & -n == n
    cc = [a*b%md for a, b in zip(hadamard(aa), hadamard(bb))]
    return [c*inv%md for c in hadamard(cc)]

inv = pow(1<<18,md-2,md)
lim=1<<18
n,x=LI()
aa=LI()

cc=[0]*lim
for a in aa:cc[a]+=1
cc=xor_convolution(cc,cc)
# print(cc[:8])

cnt=-n
for i in range(x):
    cnt+=cc[i]
    cnt%=md

ans=(lim-1)*cnt
base=1
for i in range(18):
    dd = [0]*lim
    cnt=0
    for a in aa:
        if a>>i&1:continue
        dd[a] += 1
        cnt-=1
    dd = xor_convolution(dd, dd)
    # print(i,dd[:8])
    for i in range(x):
        cnt += dd[i]
        cnt %= md
    ans-=base*cnt%md
    ans%=md
    base<<=1
print(ans//2)