//Create Time: 2018-04-26 22:02:05
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
/****head****/
const ll mod=(ll)1e9+7;
template<int sz> struct Comb{
    const ll mod = ::mod;
    ll *fac, *ifac;
    ll mem_fac[sz+5],mem_ifac[sz+5];

    // long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}

    Comb(ll *fa=0,ll *ifa=0){
        fac=fa?fa:mem_fac;
        ifac=ifa?ifa:mem_ifac;
        fac[0]=ifac[0]=1;
        for(int i=1;i<sz;++i){
            fac[i]=i*fac[i-1]%mod;
            ifac[i]=powmod(fac[i],mod-2,mod);
        }
    }
    ll C(ll n,ll m){  // n >= m
        if(n<m)return 0;
        return (fac[n]*ifac[m]%mod)*ifac[n-m]%mod;
    }
    ll A(ll n,ll m){
        if(n<m)return 0;
        return fac[n]*ifac[n-m]%mod;
    }
};

const int N=1<<17;
ll fac[N],fnv[N];
Comb<N> comb(fac,fnv);  

ll dp[18][N];
int an[N];

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    rep(i,0,m)scanf("%d",&an[i]);
    dp[m][0]=1;
    per(i,m,0)rep(j,0,1<<n){
        dp[i][j]=dp[i+1][j];
        for(int t=j,k=t&(-t);t>0;t^=k,k=t&(-t)) if(dp[i+1][j^k]){
            // OUT(i,j,t,k,t^k);
            // if(i==2 && j==2) OUT((1<<n)-an[i]-(j^k),k-1,comb.A((1<<n)-an[i]-(j^k),k-1));
            dp[i][j]=(dp[i][j] + dp[i+1][j^k] * (ll)k % mod * comb.A((1<<n)-an[i]-(j^k),k-1) % mod)%mod;
        }
        // OUT(i,j,dp[i][j]);
    }
    ll ans=0;
    rep(i,0,1<<n){
        ans+=((__builtin_popcount(i)&1)?-1ll:1ll) * dp[0][i] * fac[(1<<n)-1-i] % mod;
        // if(dp[0][i]>0)OUT(i,dp[0][i]);
    }
    ans%=mod;
    if(ans<0)ans+=mod;
    ans=ans*powmod(2,n,mod)%mod;
    cout<<ans<<endl;
    return 0;
}


Measured memory_bytes: 22272