#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }


template<int MOD>
struct ModInt {
	static const int Mod = MOD;
	unsigned x;
	ModInt() : x(0) {}
	ModInt(signed sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	ModInt(signed long long sig) { int sigt = sig % MOD; if(sigt < 0) sigt += MOD; x = sigt; }
	int get() const { return (int)x; }

	ModInt &operator+=(ModInt that) { if((x += that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator-=(ModInt that) { if((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
	ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }

	ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
	ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
	ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
};
typedef ModInt<1000000007> mint;

int main() {
	int N; int K;
	while(~scanf("%d%d", &N, &K)) {
		vector<int> cnt(N + 1, 0);
		vector<pair<int,ll>> seq;
		for(int i = 0; i < K; ++ i) {
			long long a;
			scanf("%lld", &a);
			int p = 0;
			rep(i, N)
				p += a >> i & 1;
			++ cnt[p];
			seq.emplace_back(p, a);
		}
		bool ok = true;
		rer(i, 0, N)
			ok &= cnt[i] <= 1;
		seq.emplace_back(0, 0);
		seq.emplace_back(N, (1LL << N) - 1);
		sort(seq.begin(), seq.end());
		mint ans = 1;
		rep(i, seq.size() - 1) {
			ok &= (~seq[i + 1].second & seq[i].second) == 0;
			rep(j, seq[i + 1].first - seq[i].first)
				ans *= j + 1;
		}
		if(!ok)
			ans = mint();
		printf("%d\n", ans.get());
	}
	return 0;
}