#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef vector< ll > vl;
typedef vector< vl > vvl;
typedef pair< int, int > pii;
typedef vector< pii > vp;
typedef vector< double > vd;
typedef vector< vd > vvd;
typedef vector< string > vs;

template< class T1, class T2 >
int upmin( T1 &x, T2 v ){
  if( x > v ){
    x = v;
    return 1;
  }
  return 0;
}

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

const int INF = 0x3f3f3f3f;
const int MOD7 = ( int ) 1e9 + 7;

int N, K;
deque< ll > A;

void init(){
  cin >> N >> K;
  A = deque< ll >( K );
  for( int i = 0; i < K; ++i )
    cin >> A[ i ];
}

void preprocess(){
  ll s = 0;
  // sort( A.begin(), A.end() );
  if( A.empty() or A[ 0 ] != 0 )
    A.emplace_front( 0 );
  if( A.back() != ( 1 << N ) - 1 )
    A.emplace_back( ( 1 << N ) - 1 );
  for( int i = 1; i < A.size(); ++i ){
    for( int j = 0; j < N; ++j )
      if( ( ~A[ i ] & 1LL << j ) and ( A[ i - 1 ] & 1LL << j ) )
        cout << 0 << endl, exit( 0 );
  }
  ll ans = 1LL;
  for( int i = 0; i + 1 < A.size(); ++i ){
    ll diff = A[ i ] ^ A[ i + 1 ];
    int c = 0;
    for( int j = 0; j < N; ++j )
      if( diff & 1LL << j )
        ++c;
    for( int j = 1; j <= c; ++j )
      ( ans *= j ) %= MOD7;
  }
  cout << ans << endl;
}

void solve(){

}

signed main(){
  ios::sync_with_stdio( 0 );
  init();
  preprocess();
  solve();
  return 0;
}