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

template<const unsigned int MOD> struct prime_modint {
    using mint = prime_modint;
    unsigned int v;
    prime_modint() : v(0) {}
    prime_modint(int a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    prime_modint(long long a) { a %= (int)(MOD); if(a < 0)a += MOD; v = a; }
    static constexpr int mod() { return MOD; }
    mint& operator++() {v++; if(v == MOD)v = 0; return *this;}
    mint& operator--() {if(v == 0)v = MOD; v--; return *this;}
    mint operator++(int) { mint result = *this; ++*this; return result; }
    mint operator--(int) { mint result = *this; --*this; return result; }
    mint& operator+=(const mint& rhs) { v += rhs.v; if(v >= MOD) v -= MOD; return *this; }
    mint& operator-=(const mint& rhs) { if(v < rhs.v) v += MOD; v -= rhs.v; return *this; }
    mint& operator*=(const mint& rhs) {
        v = (unsigned int)((unsigned long long)(v) * rhs.v % MOD);
        return *this;
    }
    mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
    mint operator+() const { return *this; }
    mint operator-() const { return mint() - *this; }
    mint pow(long long n) const {
        assert(0 <= n);
        mint r = 1, x = *this;
        while (n) {
            if (n & 1) r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    mint inv() const { assert(v); return pow(MOD - 2); }
    friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; }
    friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; }
    friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; }
    friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; }
    friend bool operator==(const mint& lhs, const mint& rhs) { return (lhs.v == rhs.v); }
    friend bool operator!=(const mint& lhs, const mint& rhs) { return (lhs.v != rhs.v); }
    friend std::ostream& operator << (std::ostream &os, const mint& rhs) noexcept { return os << rhs.v; }
};
using mint = prime_modint<1000000007>;
//using mint = prime_modint<998244353>;

//enumeration<mint2> enu(200000);のように宣言する
template<class T> struct enumeration{
    int _n;
    vector<T> fact,inv;
    enumeration() : _n(1),fact(1){}
    enumeration(int n) : _n(n+1),fact(n+1),inv(n+1){
        fact[0]=1;
        for(int i=1;i<=n;i++)fact[i]=fact[i-1]*i;
        inv[n]=T(1)/fact[n];
        for(int i=n-1;i>=0;i--)inv[i]=inv[i+1]*(i+1);
    }
    T Per(int n,int k){
        if(k>n)return 0;
        return fact[n]*inv[n-k];
    }
    T C(int n,int k){
        if(n<0||k<0||k>n)return 0;
        return fact[n]*inv[n-k]*inv[k];
    }
    T H(int n,int k){
        if(n==0&&k==0)return 1;
        if(n<=0||k<0)return 0;
        return C(n+k-1,k);
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> a(k);
    for(auto &&v:a)cin >> v;
    enumeration<mint> enu(200);
    a.push_back(0);
    a.push_back((1ll << n) - 1);
    sort(a.begin(), a.end());
    a.erase(unique(a.begin(), a.end()), a.end());
    for(int i = 0; i < a.size(); i++){
        for(int j = i + 1; j < a.size(); j++){
            if((a[i] & a[j]) != a[i]){
                cout << 0 << endl;
                return 0;
            }
        }
    }
    mint ans = 1;
    for(int i = 0; i + 1 < a.size(); i++){
        int b = __builtin_popcountll(a[i] ^ a[i + 1]);
        ans *= enu.fact[b];
    }
    cout << ans << endl;
}