MOD = 10 ** 9 + 7
N,K = map(int,input().split())
if K == 0:
    ans = 1
    for i in range(N):
        ans *= (i + 1)
        ans %= MOD
    print(ans)
    exit()
A = list(map(int,input().split()))
A.sort()
for i in range(K-1):
    for j in range(N):
        if A[i] & (1<<j) != 0 and A[i+1] & (1<<j) == 0:
            print(0)
            exit()
ans = 1
now = 0
A.append((1<<N)-1)
for a in A:
    b = a.bit_count()
    for i in range(b - now):
        ans *= (i + 1)
        ans %= MOD
    now = b
print(ans)