#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-12;

int main() {
	int n, k;
	vector<ll> a;
	
	cin >> n >> k;
	REP(i, k) {
		ll in;
		scanf("%lld", &in);
		a.push_back(in);
	}
	
	ll ans = 1;
	
	a.push_back(0);
	a.push_back((1ll<<n) - 1);
	
	sort(ALL(a));
	a.erase(unique(ALL(a)), a.end());
	
	FOR(i, 1, a.size()) REP(j, n) if ((a[i - 1] >> j & 1) && !(a[i] >> j & 1)) ans = 0;
	
	FOR(i, 1, a.size()) {
		int diff = 0;
		REP(j, n) if ((a[i] >> j & 1) && !(a[i - 1] >> j & 1)) diff++;
		
		REP(i, diff) ans = ans * (diff - i) % MOD;
	}
	
	cout << ans << endl;
	
	return 0;
}