#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