#include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for(int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
typedef pair<int, int> P;

int n, k;
ll MOD = 1000000007;
bool used[100];

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n >> k;
	vector<ll> a(k);
	FOR(i, k) cin >> a[i];
	sort(ALL(a));
	ll ret = 1;
	if (a.empty() || a[k-1] != pow(2, n)-1) a.push_back(pow(2, n)-1);
	FOR(i, a.size()) {
		ll x = a[i], cnt = 0;
		FOR(j, n) {
			if (used[j] && !(x & 1)) ret = 0;
			if (!used[j] && (x & 1)) {
				cnt++;
				used[j] = true;
			}
			x >>= 1;
		}
		while (cnt > 0) {
			ret = ret * cnt % MOD;
			cnt--;
		}
	}
	cout << ret << endl;
	return 0;
}