#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,K;
int MOD = 1e9+7;
int memo[100];

int fact(int n) {
    if (n==0) return 0;
    if (n==1) return 1;
    if (memo[n]) return memo[n];
    return memo[n] = (n * fact(n-1)) % MOD;
}

void solve() {
    cin>>N>>K;
    vector<int> A;
    A.push_back(0);
    int a;
    REP(i,K) {
        cin>>a;
        A.push_back(a);
    }
    A.push_back(((int)1<<N) - 1);
    UNIQUE_SORT(A);
    
    int ans = 1;
    REP(i,A.size()-1) {
        if ((A[i] | A[i+1]) != A[i+1]) {
            ans = 0;
            break;
        }
        bitset<61> b(A[i] ^ A[i+1]);
        ans *= fact(b.count());
        ans %= MOD;
    }
    
    cout << ans%MOD << endl;
}