n,m=map(int,input().split())
a=[0]+list(map(int,input().split()))+[0]
for i in reversed(range(1,n+2)):
  a[i]^=a[i-1]
M=998244353
q=[0]*(n+2)
q[sum(a)]=1
for _ in range(m):
  nq=[0]*(n+2)
  for c1 in range(n+2):
    c0=n+1-c1
    if c1>=2:
      nq[c1-2]+=q[c1]*(c1*(c1-1)//2)
      nq[c1-2]%=M
    if c0>=2:
      nq[c1+2]+=q[c1]*(c0*(c0-1)//2)
      nq[c1+2]%=M
    nq[c1]+=q[c1]*c1*c0
    nq[c1]%=M
  q=nq
print(q[0])