#include <bits/stdc++.h>

using namespace std;
int count_one(long long a){
    int ans=0;
    while(a>0){
        ans+=(a%2);
        a=a>>1;
    }
    return ans;
}

long long frac(int a){
    long long MOD=1000000007;
    long long ans=1;
    for(int i=1;i<=a;i++){
        ans=(ans*i)%MOD;
    }
    return ans;
}

int main(){
    int N,k;
    cin>>N>>k;
    vector<long long> a(k);
    for(int i=0;i<k;i++){
        cin>>a[i];
    }
    sort(a.begin(),a.end(),[](int a,int b){return count_one(a)<count_one(b);});
    for(int i=1;i<k;i++){
        if(a[i-1]>a[i]){
            cout<<0<<endl;
            return 0;
        }
        if((a[i]&a[i-1])!=a[i-1]){
            cout<<0<<endl;
            return 0;
        }
    }
    vector<int> b={0};
    for(int i=0;i<k;i++){
        b.push_back(count_one(a[i]));
    }
    b.push_back(N);
    long long ans=1;
    long long MOD=1000000007;
    for(int i=0;i<k+1;i++){
        ans=(ans*frac(b[i+1]-b[i]))%MOD;
    }
    cout<<ans<<endl;
}