#include using namespace std; using ll = long long; using PII = std::pair; using PLL = std::pair; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) int main() { #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif const int mod = 1e9+7; bool ok = true; int n, k, a, c; cin >> n >> k; int bits[n]; ll ans, frac[n+1]; fill(bits, bits + n + 1, 0); frac[0] = 1; rep(i, n) frac[i+1] = (frac[i] * (i + 1)) % mod; ans = 1; rep(i, k) { c = 0; cin >> a; rep (j, n) { if (bits[j] == 0 && a % 2 == 1) c++; else if (bits[j] == 1 && a % 2 == 0) { ok = false; break; } bits[j] = a % 2; a /= 2; } if (!ok) break; else ans = (ans * frac[c]) % mod; cout << ans << endl; } if (ok) { c = 0; rep(i, n) if (bits[i] == 0) c++; ans = (ans * frac[c]) % mod; cout << ans << endl; } else { cout << 0 << endl; } return 0; }