#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool comp(long long a,long long b){
  return __builtin_popcountll(a) < __builtin_popcountll(b);
}

const long long mod = 1000000007;

int main(){
  long long n,k;cin>>n>>k;

  vector<long long> A(k);
  for(int i = 0; k > i; i++)cin>>A[i];
  A.push_back(0);A.push_back((1<<n)-1);
  sort(A.begin(),A.end(),comp);
  A.erase(unique(A.begin(),A.end()),A.end());
  k = A.size();
  long long ans = 1;
  if(k == 2){
    for(long long i = 2; n >= i; i++){
      ans = (ans*i)%mod;
    }
    cout << ans << endl;
    return 0;
  }
  for(int i = 1; k-1 > i; i++){
    long long z = __builtin_popcountll(A[i+1]-A[i]);
    if(!z || __builtin_popcountll(A[i+1])-__builtin_popcountll(A[i]) != z){
      cout << 0 << endl;
      return 0;
    }
    ans = (ans*(1<<(z-1)))%mod;
  }
  cout << ans << endl;
}