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

#define int long long
#define MOD 1000000007

int f(int n){
    if(n == 1) return 1;
    return n * f(n-1) % MOD;
}

signed main(){
    int n, k;
    cin >> n >> k;
    int a[100];

    for(int i = 0;i < k;i++){
        cin >> a[i];
    }

    set<int> st;
    for(int i = 0;i < k;i++){
        int b = __builtin_popcount(a[i]);
        if(b == 0){
            k--;
            continue;
        }

        if(st.find(b) != st.end()){
            cout << 0 << endl; 
            return 0;
        }else{
            st.insert(b);
        }
    }

    int num = n-k;

    cout << f(num) << endl;
    
    return 0;
}