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

#define int long long
#define MOD 1000000007

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

int b(int n){
    int ans = 0;
    while(n){
        ans += n & 1;
        n >>= 1;
    }
    return ans;
} 

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

    for(int i = 0;i < k;i++){
        cin >> a[i];
    }
    sort(a, a+k);
    
    int old = 0;
    vector<int> vec;
    vec.push_back(0);
    for(int i = 0;i < k;i++){
        vec.push_back(b(a[i]));

        if((~a[i]) & old){
            cout << 0 << endl;
            return 0;
        }

        old = a[i];
    }

    vec.push_back(n);

    int ans = 1;
    for(int i = 1;i < vec.size();i++){
        cout << vec[i] << endl;
        ans = (ans * f(vec[i]-vec[i-1])) % MOD;
    }
    cout << ans << endl;
    
    return 0;
}