#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int MOD = 1e9+7;

int f[100];

int fract(int n){
    if(n == 0 || n==1) return f[n] = 1;
    if(f[n] != 0) return f[n]%MOD;
    return f[n] = n*fract(n-1)%MOD;
}

int bit_count(long long N){
    int cnt = 0;
    while(N){
        cnt++;
        N &= N-1;
    }
    return cnt;
}

bool comp(long long a, long long b){
    return bit_count(a) < bit_count(b);
}

int main(){
    int N,k; cin >> N >> k;
    fract(N);
    if(k==0){
        cout << fract(N)%MOD << endl;
        return 0;
    }

    vector<long long> A(k+2);
    for(int i=1;i<=k;i++){
        cin >> A[i];
    }
    A[0] = 0; A[k+1] = (long long) (1<<N)-1;
    sort(A.begin(), A.end(), comp);
    long long ans = 1ll;
    for(int i=0;i<A.size()-1;i++){
        if(bit_count(A[i+1]) < bit_count(A[i+1] | A[i])){
            cout << 0 << endl;
            return 0;
        }
        long long diff = bit_count(A[i] ^ A[i+1]);
        (ans *= fract(diff) ) %= MOD;
    }

    cout << ans << endl;
    return 0;

}