#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i,a,b) for(i=a;i<b;i++)
#define rloop(i,a,b) for(i=a;i>=b;i--)
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
const int inf=1000000001;
const ll INF=1e16;
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846

int main(){
	ll n,k,i,j;
	cin>>n>>k;
	vl dp(n+1);
	dp[0]=1;
	loop(i,1,n+1){
		dp[i]=(i*dp[i-1])%MOD;
	}
	vl a(k);
	loop(i,0,k){
		cin>>a[i];
	}
	if(k==0){
		cout<<dp[n]<<endl;
		return 0;
	}
	sort(a.begin(),a.end());
	vii b(k,vi(n));
	loop(i,0,k){
		ll m=a[i];
		loop(j,0,n){
			b[i][j]=m/(ll)pow(2,n-1-j);
			m%=(ll)pow(2,n-1-j);
		}
	}
	loop(i,0,n){
		ll flag=0;
		loop(j,0,k){
			if(flag==0){
				if(b[j][i]==1){
					flag=1;
				}
			}else{
				if(b[j][i]==0){
					cout<<0<<endl;
					return 0;
				}
			}
		}
	}
	ll ans=1;
	ll cnt0=0;
	ll cnt1=count(b[0].begin(),b[0].end(),1);
	ans*=dp[cnt1];
	loop(i,1,k){
		cnt0=cnt1;
		cnt1=count(b[i].begin(),b[i].end(),1);
		ans=(ans*dp[cnt1-cnt0])%MOD;
	}
	ans=(ans*dp[n-cnt1])%MOD;
	cout<<ans<<endl;
}