#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod= 1e9+7;


int a[65];
set<int> s;
int main(){
    int N,k;
    cin>>N>>k;
    int mx=0;
    REP(i,0,k) {
        cin>>a[i];
    }
    sort(a,a+k);
    REP(i,0,k){
        REP(j,i+1,k){
            if((a[j]^a[i])>a[j]){
                p(0);
                return 0;
            }
        }
    }
    ll ans=1;
    REP(i,2,N-k+1){
        ans*=i;
        ans%=mod;
    }
    p(ans);
    return 0;
}