#include "bits/stdc++.h"
#define _CRT_SECURE_NO_WARNINGS
#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define vi vector<int>
#define mp(a,b) make_pair(a,b)
using namespace std;typedef long long ll;typedef unsigned long long ull;int dx[] = { 1, -1 , 0 , 0};int dy[] = { 0,  0,  1, -1};

ll mod = 1e9 + 7;

vector<long long int> fact(ll n) {
	vector<ll> ret(n+1, 1LL);
	REP(i, 2, n + 1) {
	  ret[i] = (ret[i - 1] * i) % mod;
	}
	return ret;
}

void solve() {
	int n, k;
	cin >> n >> k;
	vector<ll> v;
	rep(i, k) {
		ll a;
		cin >> a;
		v.push_back(a);
	}
	if(k == 0){
	  ll L = 1;
	  rep(i,n){
	    L = L * (i+1) % mod;
	  }
	  P(L);
	  return;
	}
	v.push_back(0);
	v.push_back((1LL << n)-1);
	sort(v.begin(), v.end());
	ll ans = 1;
	vector<ll> facts = fact(n);
	REP(i, 1, v.size()) {
		if ((v[i] | v[i - 1]) != v[i]) {
			P(0);
			return;
		}
		int diff = __builtin_popcountll(v[i]) - __builtin_popcountll(v[i - 1]);
		ans = (ans * facts[diff]) % mod;
	}
	//int left = n - __builtin_popcountll(v[k-1]);
	//ans = (ans * facts[left]) % mod;
	P(ans);
}

int main() {
	solve();
	return 0;
}