#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (int i = (int)a; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF 1000000000
#define PI 3.14159265359
#define EPS 1e-12

ll fact[70];

int main(void)
{
  int n, k;
  cin >> n >> k;
  ll a[70];
  REP(i, k) cin >> a[i];

  sort(a, a+n);
  bool isbit[70] = {false};
  REP(i, k) {
    //a_iの立っているビットをチェク
    REP(j, n) {
      if(isbit[j] && !(a[i] >> j & 1)) {cout << 0 << endl; return 0;}
      if(!isbit[j] && a[i] >> j & 1) isbit[j] = true;
    }
  }

  fact[0] = 1;
  FOR(i, 1, 70) {
    fact[i] = (fact[i-1] * i) % MOD;
  }

  int count = 0;
  ll ans = 1;
  REP(i, k) {
    int diff = __builtin_popcount(a[i]) - count;
    count = __builtin_popcount(a[i]);
    ans = (ans * fact[diff]) % MOD;
  }
  if(n - count > 0) {
    ans = (ans * fact[n-count]) % MOD;
  }

  cout << ans << endl;

  return 0;
}