import math
n,k=map(int,input().split())
b=lambda x:sum(i=="1" for i in bin(x))
if k<1:
	a=[]
else:
	a=sorted(map(int,input().split()))
f=0
c=1
for i in a:
	if i&f!=f:
		print(0)
		exit()
	t=b(i^f)
	c*=math.factorial(t)
	f=i
t=n-b(f)
c*=math.factorial(t)
print(c%(10**9+7))