#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, K;
ll A[65];

bool isValid(){
    for(int i=0;i<=K;++i){
        if((A[i] & A[i+1]) != A[i]){
            return false;
        }
    }
    return true;
}

const ll MOD = 1e9 + 7;

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N >> K;

    for(int i=1;i<=K;++i){
        std::cin >> A[i];
    }

    sort(A+1, A+1+K);

    A[K+1] = (1ll << N) - 1;

    ll res = 0ll;
    if(isValid()){
        res = 1ll;
        for(int i=0;i<=K;++i){
            ll diff = A[i+1] ^ A[i], n = __builtin_popcountll(diff);
            for(int j=1;j<=n;++j){
                res = (res * j) % MOD;
            }
        }
    }

    std::cout << res << std::endl;
}