#define _CRT_SECURE_NO_WARNINGS
#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())

#define MOD 1000000007


inline int popcount64(unsigned long long x) {
#if defined(_MSC_VER)
	return __popcnt(x >> 32) + __popcnt(x);
#elif defined(__GNUC__)
	return __builtin_popcountll(x);
#else 
	x = (x >> 1 & 0x5555555555555555ULL) + (x & 0x5555555555555555ULL);
	x = (x >> 2 & 0x3333333333333333ULL) + (x & 0x3333333333333333ULL);
	x = (x >> 4 & 0x0f0f0f0f0f0f0f0fULL) + (x & 0x0f0f0f0f0f0f0f0fULL);
	x = (x >> 8 & 0x00ff00ff00ff00ffULL) + (x & 0x00ff00ff00ff00ffULL);
	x = (x >> 16 & 0x0000ffff0000ffffULL) + (x & 0x0000ffff0000ffffULL);
	return ((x >> 32) + (x & 0xffffffff));
#endif
}


int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n, k;
	cin >> n >> k;
	long long prev = 0, prevpop = 0;
	long long ans = 1;
	long long a[61];
	rep(i, k)cin >> a[i];
	sort(a, a + k);
	rep(i,k) {
		if ((a[i]&prev)!=prev) {
			ans = 0;
			break;
		}
		int pop = popcount64(a[i]);
		for (int i = 1; i <= pop - prevpop;i++) {
			(ans *= i) %= MOD;
		}
		prev = a[i];
		prevpop = pop;
	}
	if (prevpop != n) {
		for (int i = 1; i <= n - prevpop; i++) {
			(ans *= i) %= MOD;
		}
	}

	cout << ans << endl;


	return 0;
}