N,k=map(int,input().split())
if k==0:
    A=[]
else:
    A=list(map(int,input().split()))

mod=10**9+7

FACT=[1]

for i in range(1,100):
    FACT.append(FACT[-1]*i%mod)

A.sort()

if A==[] or A[0]!=0:
    A=[0]+A
    k+=1

if A[-1]!=(1<<N)-1:
    A.append((1<<N)-1)
    k+=1

LIST=[]

for i in range(1,k):
    if A[i]&A[i-1]==A[i-1]:

        b=A[i-1].bit_count()
        c=A[i].bit_count()
        LIST.append(c-b)
    else:
        print(0)
        exit()

ANS=1

for l in LIST:
    ANS=ANS*FACT[l]%mod

print(ANS)