#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<int, int>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, k;
    cin, n, k;
    if (k == 0) {
        ll ans = 1;
        REP(i, 0, n) {
            ans *= (i + 1);
        }
        cout << ans << endl;
    } else {
        vector<ll> v(n + 1, -1);
        REP(i, 0, k) {
            ll a;
            cin, a;
            int cnt = __builtin_popcountll(a);
            if (v[cnt] != -1) {
                cout << 0 << endl;
                return 0;
            } else {
                v[cnt] = a;
            }
        }
        ll mask = 0;
        REP(i, 0, n + 1) {
            if (v[i] != -1) {
                mask |= v[i];
                if (mask != v[i]) {
                    cout << 0 << endl;
                    return 0;
                }
            }
        }
        ll ans = 1;
        int len = 1;
        REP(i, 1, n + 1) {
            ans *= len;
            if (v[i] != -1) {
                len = 1;
            } else {
                len++;
            }
        }
        cout << ans << endl;
    }

    return 0;
}