#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const long long mod = 10e9+7;
long long factorial[61];
int N;
int diff(long long x,long long y){
    int count = 0;
    for(int i=0;i<N;i++){
        if((x & 1<<i) > (y & 1 << i)){
            return 0;
        }
        else if((x & 1<<i) < (y & 1 << i)){
            count++;
        }
    }
    return count;
}
int main(){
    int k,d;
    vector<long long> a;
    long long input;
    long long ans = 1;
    cin >> N >> k;
    factorial[0] = 1;
    for(int i=1;i<=N;i++){
        factorial[i] = factorial[i-1]*i % mod;
    }
    for(int i=0;i<k;i++){
        cin >> input;
        a.push_back(input);
    }
    a.push_back(0);
    sort(a.begin(),a.end());
    a.push_back((1<<N) -1);
    for(int i=0;i<a.size()-1;i++){
         d = diff(a[i],a[i+1]);
         if(d == 0){
             ans = 0;
             break;
         }
         ans = (ans*factorial[d])%mod;
    }
    cout << ans << endl;
    return 0;
}