def solve(n, m, arr):
    mod = 10**9 + 7
    fact = [1] * (n + 1)
    for i in range(2, n + 1):
        fact[i] = fact[i - 1] * i % mod

    arr.sort()
    if n == 1:
        return 1

    val = arr.pop()
    arr[-1] += val

    def mod_inverse(a, mod):
        return pow(a, mod - 2, mod)
    
    ans = fact[n]
    temp = 1
    for count in arr:
        temp = (temp * fact[count]) % mod
    
    temp = mod_inverse(temp, mod)
    return (ans * temp) % mod

#include <iostream>
#include <vector>
#include <algorithm>

const int MOD = 1e9 + 7;

using namespace std;

long long solve(const vector<int>& a, int b) {
    int c = a.size();
    long long d = 0;
    for (int i = 0; i < c; i++) {
        d += a[i];
    }

    vector<long long> e(b + 1, 0);
    e[0] = 1; 

    for (int i = 0; i < c; i++) {
        for (int j = b; j >= a[i]; j--) {
            e[j] = (e[j] + e[j - a[i]]) % MOD;
        }
    }
    long long f = 1;
    for (int i = 0; i < c; i++) {
        f = (f * 2) % MOD;
    }

    long long g = 0;
    for (int i = 0; i <= b; i++) {
        g = (g + e[i]) % MOD;
    }

    long long h = (f - 2 * g + MOD) % MOD;
    return h;
}

Do apply everyone