#include<stdio.h>
#include<stdlib.h>
#include<string.h>

long long mod=1000000007;
long long dp[62];

typedef struct {
	int b[62];
} bits;

int cmp(const void*a,const void*b){
	return ((bits*)a)->b[61]-((bits*)b)->b[61];
}

int bitcheck(long long a,bits* b,int c){
	if(a%2==1){
		a--;
		b->b[c]=1;
	}else{
		b->b[c]=0;
	}
	if(a==0) return;
	bitcheck(a/2,b,c+1);
}

long long kaijo(int a){
	if(dp[a]>0LL) return dp[a];
	if(a==0) return dp[0]=1;
	return dp[a]=(long long)a*kaijo(a-1)%mod;
}

int main(){
	int n,k,i,j,check[60],bitsum;
	bits bit[61];
	long long a,ans;
	memset(bit,0,sizeof(bit));
	scanf("%d %d",&n,&k);
	for(i=0;i<k;i++){
		scanf("%lld",&a);
		bitcheck(a,&bit[i],0);
		for(j=0;j<n;j++){
			bit[i].b[61]+=bit[i].b[j];
		}
	}
	qsort(bit,k,sizeof(bits),cmp);
	memset(check,0,sizeof(check));
	memset(dp,0,sizeof(dp));
	ans=1;
	bitsum=0;
	for(i=0;i<k;i++){
		for(j=0;j<n;j++){
			if(check[j]==1 && bit[i].b[j]==0){
				printf("0\n");
				return 0;
			}
			check[j]=bit[i].b[j];
		}
		ans*=kaijo(bit[i].b[61]-bitsum);
		ans%=mod;
		bitsum=bit[i].b[61];
	}
	ans*=kaijo(n-bitsum);
	ans%=mod;
	printf("%lld\n",ans);
	return 0;
}