#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 a[100], MOD = 1000000007;

int main(int argc, char const *argv[]) {
	ios_base::sync_with_stdio(false);
	cin >> n >> k;
	FOR(i, k) cin >> a[i];
	a[k] = 0;
	a[k+1] = (1LL<<n)-1;
	k += 2;
	sort(a, a+k);
	ll ret = 1;
	FOR(i, k-1) {
		if (a[i] & ~a[i+1]) ret = 0;
		int x = __builtin_popcountll(a[i+1])-__builtin_popcountll(a[i]);
		while (x > 1) {
			ret = ret * (x--) % MOD;
		}
	}
	cout << ret << endl;
	return 0;
}