#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <sstream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
#include <bitset>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()



ulint popcount(ulint n)
{
	ulint cnt = 0;
	while (n) { cnt++; n &= n - 1; }
	return cnt;
}

bool comp(ulint a, ulint b) { return popcount(a) < popcount(b); }

ulint modfac(ulint n, ulint m)
{
	ulint res = 1;
	for (ulint i = 1; i <= n; i++) res = res * i % m;
	return res;
}

int yuki0462()
{
	const ulint MOD = 1000000007;
	int N, k;
	cin >> N >> k;

	vector<ulint> a(k + 2);
	a[0] = 0; a[k + 1] = ((ulint)1 << N) - 1;
	for (int i = 1; i <= k; i++) cin >> a[i];

	sort(all(a), comp);

	ulint ans = 1;

	for (int i = 0; i < a.size() - 1; i++) {
		if (popcount(a[i + 1]) < popcount(a[i] | a[i + 1])) {
			cout << 0 << endl;
			return 0;
		}
		ulint d = popcount(a[i] ^ a[i + 1]);
		ans = ans * modfac(d, MOD) % MOD;
	}

	cout << ans << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0462();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}