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

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

const ll mod=1e9+7;

inline ll fact(int n)
{
    ll ret=1;
    for(int i=2; i<=n; ++i) (ret*=i)%=mod;
    return ret;
}

ll solve()
{
    int n,k;
    scanf(" %d %d", &n, &k);

    int ct[61]={};
    vector<int> x;
    rep(i,k)
    {
        ll a;
        scanf(" %lld", &a);

        int bit = __builtin_popcount(a);
        x.pb(bit);
        ++ct[bit];
    }

    if(k==0) return fact(n);
    rep(i,61) if(ct[i]>1) return 0;

    sort(all(x));

    ll ret=1;
    (ret*=fact(x[0]))%=mod;
    for(int i=1; i<k; ++i) (ret*=fact(x[i]-x[i-1]))%=mod;
    (ret*=fact(n-x[k-1]))%=mod;
    return ret;
}

int main()
{
    cout << solve() << endl;
    return 0;
}