#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,k;
ll a[252];

ll fact(ll x){
  ll r = 1;
  while(x>0){
    r = r*x%MOD;
    x--;
  }
  return r;
}

int main(){
  scanf("%d%d",&n,&k);
  a[0] = 0;
  REP(i,k)scanf("%lld",a+i+1);
  k++;
  a[k++] = (1ll<<n)-1;
  sort(a,a+k);
  ll ans = 1;
  REP(i,k-1){
    ll bef = a[i];
    ll aft = a[i+1];
    ll cros = bef & aft;
    if(cros != bef){
      ans = 0;
      break;
    }
    ll mul = __builtin_popcount(aft ^ cros) + __builtin_popcount((aft^cros)>>32);
    ans = ans*fact(mul)%MOD;
  }
  printf("%lld\n",ans);
  return 0;
}