#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=1000000007;
int main(){
  
    ll n,k;cin>>n>>k;
    if(k==0){
        ll s=1;
        for(ll i=1;i<=n;i++){
            s*=i;
            s%=mod;
        }
        cout<<s<<endl;
        return 0;
    }
    ll a[k];for(ll i=0;i<k;i++)cin>>a[i];
    sort(a,a+k);
    ll sum=0;
    ll ans=1;
    for(ll i=0;i<k;i++){
      ll r=sum|a[i];
        if(r!=a[i]){
            cout<<0<<endl;
            return 0;
        }
        ll j=sum^a[i];
        ll u=__builtin_popcount(j);
        for(ll y=u;y>=1;y--){
            ans*=y;
            ans%=mod;
        }
        sum=a[i];
      
    }
    ll x=__builtin_popcount(a[k-1]);
    for(ll i=n-x;i>=1;i--){
        ans*=i;
        ans%=mod;
    }
    cout<<ans<<endl;
}