import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N,K,*A = map(int,read().split())

MOD = 10**9 + 7

fact = [1] * 100
for n in range(1,100):
    fact[n] = fact[n-1] * n % MOD

def popcount(N):
    ret = 0
    while N:
        if N & 1:
            ret += 1
        N //= 2
    return ret

def solve(A):
    full = (1<<N) - 1
    A = [0] + sorted(A) + [full]
    A.append(full)
    ret = 1
    for x,y in zip(A,A[1:]):
        if x & y != x:
            return 0
        p = popcount(x ^ y)
        ret *= fact[p]
    return ret % MOD

print(solve(A))