#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;
vl A;

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

void preprocess(){
  ll s = 0;
  sort( A.begin(), A.end() );
  for( int i = 0; i < K; ++i ){
    s |= A[ i ];
    if( s > A[ i ] )
      cout << 0 << endl, exit( 0 );
  }
  if( s >= 1LL << N )
    cout << 0 << endl, exit( 0 );
  ll ans = 1LL;
  for( int i = 1; i <= N - K - ( K > 0 and A[ 0 ] == 0 ); ++i )
    ( ans *= i ) %= MOD7;
  cout << ans << endl;
}

void solve(){

}

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