#include<iostream>
#include<algorithm>
using namespace std;
typedef long long int ll;
const ll M=1e9+7;
int main()
{
	int n,k;cin>>n>>k;
	ll a[100]={};
	for(int i=0;i<k;i++)cin>>a[i];
	sort(a,a+k);
	a[k++]=(1LL<<n)-1;
	ll now=0;
	ll c=1;
	for(int i=0;i<k;i++)
	{
		if((now|a[i])>a[i]){c=0;break;}
		ll tmp=now^a[i];
		int cou=0;
		while(tmp)
		{
			tmp=tmp&(tmp-1);
			cou++;
		}
		while(cou)
		{
			c*=cou--;
			c%=M;
		}
		now=a[i];
	}
	cout<<c%M<<endl;
	return 0;
}