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

bool comp(int a,int b){
  return __builtin_popcount(a) < __builtin_popcount(b);
}

const long long mod = 1000000007;

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