#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
constexpr ll MOD = 1'000'000'007;

int main(){
    int n, m;
    cin >> n >> m;
    vector<ll> v(n), r(m);
    for(auto &p: v) cin >> p;
    for(auto &p: r) cin >> p;
    int a, b;
    cin >> a >> b;

    const int cntlim = 100010;
    vector<ll> vcnt(cntlim, 0), rcnt(cntlim, 0);
    vcnt[0] = rcnt[0] = 1;
    for(auto &p: v){
        for(int i = cntlim-1; i >= 0; i--){
            if(vcnt[i] > 0) vcnt[i+p] += vcnt[i];
        }
    }
    for(auto &p: r){
        for(int i = cntlim-1; i >= 0; i--){
            if(rcnt[i] > 0) rcnt[i+p] += rcnt[i];
        }
    }
    vcnt[0] = 0;
    rcnt[0] = 0;
    for(int i = 1; i < cntlim; i++) rcnt[i] += rcnt[i-1];
    ll ans = 0;
    for(ll v1 = 1; v1 < cntlim; v1++){
        ll r1 = 0;
        int wa = v1+1;
        while(wa-r1 > 1){
            ll mid = (wa+r1)/2;
            if(mid*a <= v1) r1 = mid;
            else wa = mid;
        }
        ll r2 = v1+1;
        wa = 0;
        while(r2-wa > 1){
            ll mid = (wa+r2)/2;
            if(mid*b >= v1) r2 = mid;
            else wa = mid;
        }
        if(r1 < r2) continue;
        //cerr << r1 << " " << r2 << " ";
        //cerr << vcnt[v1]*(rcnt[r1]-rcnt[r2-1]) << endl;
        ans += vcnt[v1]*(rcnt[r1]-rcnt[r2-1]);
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}