#include <bits/stdc++.h>

using namespace std;

template <typename T>
T power(T a, long long b) {
  T r = 1;
  while (b) {
    if (b & 1) {
      r *= a;
    }
    a *= a;
    b >>= 1;
  }
  return r;
}

template <typename T>
T inverse(T a, T m) {
  a %= m;
  if (a < 0) {
    a += m;
  }
  T b = m, u = 0, v = 1;
  while (a) {
    T t = b / a;
    b -= a * t;
    swap(a, b);
    u -= v * t;
    swap(u, v);
  }
  if (u < 0) {
    u += m;
  }
  return u;
}

template <int _P>
struct modnum {
  static constexpr int P = _P;

 private:
  int v;

 public:
  modnum() : v(0) {
  }

  modnum(long long _v) {
    v = _v % P;
    if (v < 0) {
      v += P;
    }
  }

  explicit operator int() const {
    return v;
  }

  bool operator==(const modnum& o) const {
    return v == o.v;
  }

  bool operator!=(const modnum& o) const {
    return v != o.v;
  }

  modnum inverse() const {
    return modnum(::inverse(v, P));
  }

  modnum operator-() const {
    return modnum(v ? P - v : 0);
  }
  
  modnum operator+() const {
    return *this;
  }

  modnum& operator++() {
    v++;
    if (v == P) {
      v = 0;
    }
    return *this;
  }
  
  modnum& operator--() {
    if (v == 0) {
      v = P;
    }
    v--;
    return *this;
  }

  modnum operator++(int) {
    modnum r = *this;
    ++*this;
    return r;
  }
  
  modnum operator--(int) {
    modnum r = *this;
    --*this;
    return r;
  }

  modnum& operator+=(const modnum& o) {
    v += o.v;
    if (v >= P) {
      v -= P;
    }
    return *this;
  }

  modnum operator+(const modnum& o) const {
    return modnum(*this) += o;
  }

  modnum& operator-=(const modnum& o) {
    v -= o.v;
    if (v < 0) {
      v += P;
    }
    return *this;
  }

  modnum operator-(const modnum& o) const {
    return modnum(*this) -= o;
  }

  modnum& operator*=(const modnum& o) {
    v = (int) ((long long) v * o.v % P);
    return *this;
  }

  modnum operator*(const modnum& o) const {
    return modnum(*this) *= o;
  }
  
  modnum& operator/=(const modnum& o) {
    return *this *= o.inverse();
  }

  modnum operator/(const modnum& o) const {
    return modnum(*this) /= o;
  }
};

template <int _P>
ostream& operator<<(ostream& out, const modnum<_P>& n) {
  return out << int(n);
}

template <int _P>
istream& operator>>(istream& in, modnum<_P>& n) {
  long long _v;
  in >> _v;
  n = modnum<_P>(_v);
  return in;
}

using num = modnum<1000000007>;

int main() {
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(m);
  for (int i = 0; i < m; ++i) {
    cin >> a[i];
  }
  reverse(a.begin(), a.end());
  vector<num> fact((1 << n) + 1), inv_fact((1 << n) + 1);
  fact[0] = inv_fact[0] = 1;
  for (int i = 0; i < 1 << n; ++i) {
    fact[i + 1] = fact[i] * (i + 1);
    inv_fact[i + 1] = inv_fact[i] / (i + 1);
  }
  auto binom = [&](int x, int y) {
    if (x < y) {
      return num(0);
    } else {
      return fact[x] * inv_fact[y] * inv_fact[x - y];
    }
  };
  vector<num> dp(1 << n);
  dp[0] = 1;
  for (int b : a) {
    for (int s = (1 << n) - 1; ~s; --s) {
      for (int i = 0; i < n; ++i) {
        if (!(s >> i & 1)) {
          dp[s | 1 << i] -= dp[s] * binom((1 << n) - b - s, (1 << i) - 1);
        }
      }
    }
  }
  num ans = 0;
  for (int s = 0; s < 1 << n; ++s) {
    num ways = dp[s] * fact[(1 << n) - 1 - s];
    for (int i = 0; i < n; ++i) {
      if (!(s >> i & 1)) {
        ways *= inv_fact[1 << i];
      }
    }
    ans += ways;
  }
  for (int i = 0; i < n; ++i) {
    ans *= fact[1 << i];
  }
  ans *= 1 << n;
  cout << ans << "\n";
  return 0;
}


Measured memory_bytes: 1024