#include <bits/stdc++.h>
using namespace std;

int N, M;
long long V[110], R[100];
long long A, B;
long long v[2][1001001] = {}, r[2][1001001] = {}, sum[1001001] = {};
long long const mod = 1000000007;

void dp() {
    v[0][0] = true;
    for(int i=1; i<=N; ++i) {
        for(int j=0; j<=1000000; ++j) {
            if(j < V[i]) v[i & 1][j] = v[(i - 1) & 1][j];
            else v[i & 1][j] = (v[(i - 1) & 1][j] + v[(i - 1) & 1][j - V[i]]) % mod;
        }
    }

    r[0][0] = true;
    for(int i=1; i<=M; ++i) {
        for(int j=0; j<=1000000; ++j) {
            if(j < R[i]) r[i & 1][j] = r[(i - 1) & 1][j];
            else r[i & 1][j] = (r[(i - 1) & 1][j] + r[(i - 1) & 1][j - R[i]]) % mod;
        }
    }
}

void takesum() {
    for(int j=1; j<=1000000; ++j) {
        sum[j] = (sum[j - 1] + v[N & 1][j]) % mod;
    }
}

long long cnt(long long l, long long r) {
    if(l == 0 || r == 0) return 0;
    r = min(r, 1000000LL);
    l = min(l, 1000000LL);
    long long ret = sum[r] - sum[l - 1];
    if(ret < 0) ret = (ret + mod) % mod;
    return ret;
}

long long solve() {
    long long ret = 0;
    for(int j=1; j<=1000000; ++j) {
        long long s = r[M & 1][j];
        long long t = cnt(A * j, B * j);
        ret = (ret + s * t % mod) % mod;
    }
    return ret;
}

int main() {
    cin >> N >> M;
    for(int i=1; i<=N; ++i) cin >> V[i];
    for(int i=1; i<=M; ++i) cin >> R[i];
    cin >> A >> B;

    dp();
    takesum();
    cout << solve() << '\n';
}