#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 main(){
    int N,k; cin >> N >> k;
    fract(N);
    if(k==0){
        cout << fract(N)%MOD << endl;
        return 0;
    }

    vector<long long> A(k);
    vector<int> bits(k);
    for(int i=0;i<k;i++){
        cin >> A[i];
    }
    sort(A.begin(), A.end());
    long long bit = 0;
    for(int i=0;i<k;i++){
        int bit_count = 0;
        for(int j=0;j<N;j++){
            if(((bit>>j)&1) == 1 && ((A[i]>>j)&1) == 0){
                cout << 0 << endl;
                return 0;
            }
            if((A[i]>>j)&1) bit_count++;
            bit |= A[i];
        }
        bits[i] = bit_count;
    }
    bits.push_back(N);

    long long ans = 1ll;
    for(int i=0;i<k;i++){
        (ans *= fract(bits[i+1] - bits[i]) ) %= MOD;
    }
    cout << ans << endl;
    return 0;

}