#include<bits/stdc++.h>
long long fact(int n){
    if(!n)return 1;
    return (fact(n-1)*n)%1000000007;
}
main(){
    int N,K;
    long long A[63],max = 0,sum = 1;
    scanf("%d%d",&N,&K);
    A[0] = 0;
    A[1] = (1LL<<N)-1;
    for(int i = 0;i < K;i++){
        scanf("%lld",&A[i+2]);
    }
    std::sort(A,A+K+2);
    for(int i = 0;i < K+2;i++){
        for(int j = 0;j <= 62;j++){
            long long b = 1 << j;
            if((b&max) && !(b&A[i])){
                printf("0\n");
                return 0;
            }
        }
        max = max|A[i];
    }
    for(int i = 0;i < K+1;i++){
        sum = (sum*fact(__builtin_popcountll(A[i+1])-__builtin_popcountll(A[i])))%1000000007;
    }
    printf("%lld\n",sum);
}