#include<bits/stdc++.h>
using namespace std;
#define int long long
#define MOD (int)(1e9+7)
int bitnum(int n){
  int res=n%2;
  while(n/=2)res+=n%2;
  return res;
}
int mul(int a,int b){
  return ((a%MOD)*(b%MOD))%MOD;
}
int fact(int k){
  if(!k)return 1;
  return mul(k,fact(k-1));
}
signed main(){
  int n,k,r=1;
  cin>>n>>k;
  if(!k){
    cout<<fact(n)<<endl;
    return 0;
  }
  vector<int> a(k),b(k,0);
  cin>>a[0];
  b[0]=bitnum(a[0]);
  for(int i=1;i<k;++i){
    cin>>a[i];
    b[i]=bitnum(a[i]);
    if(a[i]<=a[i-1]||b[i]<=b[i-1]){
      cout<<0<<endl;
      return 0;
    }
  }
  r=fact(b[0]);
  for(int i=1;i<k;++i)r=mul(r,fact(b[1]-b[0]));
  cout<<r<<endl;
  return 0;
}