#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//const ll mod = 998'244'353;
const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

int main(){
    //typedef int ll;
    int n,m;
    cin>>n>>m;
    vector<int> v(n),r(m);
    for(int i = 0;i<n;i++) cin>>v[i];
    for(int i = 0;i<m;i++) cin>>r[i];
    ll mx = 100000 + 10;
    vector<mint> sv(mx+1,0),sr(mx+1,0);
    sv[0] += 1;
    sr[0] += 1;
    for(int i = 0;i<n;i++){
        for(int j = mx;j>=0;j--){
            int k = j - v[i];
            if(k<0) break;
            sv[j] += sv[k];
        }
    }
    for(int i = 0;i<m;i++){
        for(int j = mx;j>=0;j--){
            int k = j - r[i];
            if(k<0) break;
            sr[j] += sr[k];
        }
    }
    mint ans = 0;
    for(int i = 1;i<=mx;i++) sv[i] += sv[i-1];
    int a,b;
    cin>>a>>b;
    //cout<<3<<endl;
    for(ll i = 1;i<=mx;i++){
        ll l = a*i;
        ll r = min(mx,b*i);
        if(l>mx) break;
        //cout<<l<<" "<<r<<endl;
        assert(0<=l&&l<=mx&&0<=r&&r<=mx);
        if(l==0) ans += sv[r] * sr[i];
        else ans += (sv[r] - sv[l-1]) * sr[i];
    }
    cout<<ans<<endl;
}