// #includes {{{
#include <algorithm>
#include <numeric>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <list>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <cmath>
using namespace std;
// }}}
// pre-written code {{{
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define RREP(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define LET(x,a) __typeof(a) x(a)
//#define IFOR(i,it,c) for(__typeof((c).begin())it=(c).begin();it!=(c).end();++it,++i)
#define ALL(c) (c).begin(), (c).end()
#define MP make_pair

#define EXIST(e,s) ((s).find(e)!=(s).end())

#define RESET(a) memset((a),0,sizeof(a))
#define SET(a) memset((a),-1,sizeof(a))
#define PB push_back
#define DEC(it,command) __typeof(command) it=command

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define debug2(x) cerr << #x << " = [";REP(__ind,(x).size()){cerr << (x)[__ind] << ", ";}cerr << "] (L" << __LINE__ << ")" << endl;

const int INF=0x3f3f3f3f;

typedef long long Int;
typedef unsigned long long uInt;
#ifdef __MINGW32__
typedef double rn;
#else
typedef long double rn;
#endif

typedef pair<int,int> pii;

/*
#ifdef MYDEBUG
#include"debug.h"
#include"print.h"
#endif
*/
// }}}

const int mod = 1000000007;


typedef int Num;

//{{{ operation
inline Num prod(const Num &a, const Num &b, const Num m = mod){
	Num c = (a*(long long)b)%m;
//	assert(0<=c and c<m);
	return c;
}
inline void mult(Num &a, const Num &b, const Num m = mod){
	a = prod(a,b,m);
}
inline Num sum(const Num &a, const Num &b, const Num m = mod){
	Num c=a+b;
	if(c>=m)c-=m;
//	assert(0<=c and c<m);
	return c;
}
inline Num add(Num &a, const Num &b, const Num m = mod){
	a = sum(a,b,m);
}
inline Num neg(const Num &a, const Num m = mod){
	if(a==0)return 0;
	else return m-a;
}
inline Num diff(const Num &a, const Num &b, const Num m = mod){
	Num c=a-b;
	if(c<0)c+=m;
	return c;
}
inline Num subt(Num &a, const Num &b, const Num m = mod){
	a -= b;
	if(a<0)a+=m;
}
/*
inline Num inv(const Num &a, const Num m = mod){
	return invMod(a,m);
}
inline Num quot(const Num &a, const Num &b, const Num m = mod){
	return prod(a,inv(b,m),m);
}
inline void divide(Num &a, const Num &b, const Num m = mod){
	a = prod(a,inv(b,m),m);
}
*/
//}}}

int fact[66];

int N,k;

int main(){
	int f = 1;
	for(int i=0;i<66;i++){
		fact[i] = f;
		mult(f,i+1);
	}
	vector<pair<int,Int> > a;
	cin>>N>>k;
	REP(i,k){
		Int t;
		cin>>t;
		a.push_back(make_pair(__builtin_popcountll(t),t));
	}
	sort(ALL(a));
	if(a.size()==0){
		cout<<fact[N]<<endl;
		return 0;
	}
	bool valid = true;
	REP(i,k-1){
		if(a[i].first>=a[i+1].first or (a[i].second&a[i+1].second)!=a[i].second){
			valid = false;
		}
	}
	if(!valid){
		cout<<0<<endl;
		return 0;
	}
	int ans = 1;
	mult(ans,fact[a[0].first]);
	REP(i,k-1){
		mult(ans,fact[a[i+1].first-a[i].first]);
	}
	mult(ans,fact[N-a[k-1].first]);
	cout<<ans<<endl;
	return 0;
}