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

int popcnt(ll n) {
    int cnt=0;
    while (n) {
        cnt++;
        n&=n-1;
    }
    return cnt;
}

int main() {
    int mod=1e9+7;
    int n,k;
    cin>>n>>k;
    ll fact[n+1];
    fact[0]=1;
    for (int i=1;i<=n;i++)
        fact[i]=i*fact[i-1]%mod;
    ll a[k+2];
    for (int i=0;i<k;i++)
        cin>>a[i];
    a[k]=0;
    a[k+1]=(1LL<<n)-1;
    sort(a,a+k+2);
    ll ans=1;
    for (int i=0;i<k+1;i++) {
        if (a[i]&~a[i+1]) {
            puts("0");
            return 0;
        }
        ans=ans*fact[popcnt(a[i+1])-popcnt(a[i])]%mod;
    }
    cout<<ans<<endl;
    return 0;
}