import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())


N,K = MI()
mod = 10**9+7

fac = [1]
for i in range(1,N+1):
    fac.append((fac[-1]*i) % mod)

if K == 0:
    print(fac[N])
    exit()

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

flag = [0]*N
ans = 1
for i in range(len(A)-1):
    c = A[i+1]-A[i]
    r = 0
    for j in range(N):
        if (c>>j) & 1:
            if flag[j]:
                print(0)
                exit()
            else:
                flag[j] = 1
                r += 1
    ans *= fac[r]
    ans %= mod

print(ans)