Sum

/* Murad Eynizade */

#include <bits/stdc++.h>
#define intt long long
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define SIZE 100001
#define INF INT_MAX
#define F first
#define S second
#define in(a) scanf("%d",&a);
#define outn(a) printf("%d\n",&a);
#define outs(a) printf("%d ",&a);
#define MOD 1000000007

using namespace std;

intt n , m , x , y;

vector< pair<intt,intt> >v[4];

intt ans[4];

map<intt,intt>mp;

intt powmod(intt a,intt b) {
    if (b == 0)return 1LL % MOD;
    if (b == 1)return a % MOD;
    intt help = powmod(a , b / 2);
    if (b % 2) return help * help % MOD * a % MOD;
    return help * help % MOD;
}

int main()
{
    FAST_READ;
    cin>>n>>m;
    //cout<<2LL * powmod(powmod(2 , n - 2) , 2) % MOD<<endl;
    bool en = false;
    while (m--) {
        cin>>x;
        y = x / 2;
        if (y == 1)en = true;
        while (y > 3) y /= 2;
        v[y].push_back({x / 2, x});
    }
    if (en) {
        cout<<0<<endl;
        return 0;
    }
    sort(v[2].begin(),v[2].end());
    sort(v[3].begin(),v[3].end());
    ans[2] = ans[3] = powmod(2 , n - 2);
    /*for (auto i : v[2]) {
        bool f = false;
        x = i.first;
        while (x > 3) {
            if (mp[x]) {
                f = true;
                break;
            }
            x /= 2;
        }
        if (f)continue;
        mp[x] = mp[i.second] = 1;
        ans[2] = (ans[2] - powmod(2 , n - (int)log2(i.second) - 1) + MOD) % MOD;
    }
    for (auto i : v[3]) {
        bool f = false;
        x = i.first;
        while (x > 3) {
            if (mp[x]) {
                f = true;
                break;
            }
            x /= 2;
        }
        if (f)continue;
        mp[x] = mp[i.second] = 1;
        ans[3] = (ans[3] - powmod(2 , n - (int)log2(i.second) - 1) + MOD) % MOD;
    }*/
    cout<<ans[2] * ans[3] % MOD * 2LL % MOD<<endl;
    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER