#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 1e9+7;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const { return mint(-x);}
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        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(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {return pow(modc-2);}
    mint& operator/=(const mint& a){ return (*this) *= a.inv();}
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{ return x == a.x;}
    bool operator != (const mint& a) const{ return x != a.x;}
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
    ll val(){ return x;}
};

int main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N, M, a, b, v;
    cin >> N >> M;
    mint ans=0;
    vector<mint> dp1(1e5+1), dp2(1e5+1);
    dp1[0] = 1; dp2[0] = 1;

    for (int i=0; i<N; i++){
        cin >> v;
        vector<mint> pd1(1e5+1);
        for (int j=0; j<=1e5; j++){
            if (j+v <= 1e5) pd1[j+v] += dp1[j];
            pd1[j] += dp1[j];
        }
        swap(pd1, dp1);
    }
    for (int i=0; i<M; i++){
        cin >> v;
        vector<mint> pd2(1e5+1);
        for (int j=0; j<=1e5; j++){
            if (j+v <= 1e5) pd2[j+v] += dp2[j];
            pd2[j] += dp2[j];
        }
        swap(pd2, dp2);
    }


    for (int i=1; i<=1e5; i++) dp1[i] += dp1[i-1];

    cin >> a >> b;
    for (int i=1; i<=1e5; i++){
        if (a*i > 100000LL) continue;
        ans += (dp1[min(b*i, 100000LL)]-dp1[a*i-1]) * dp2[i];
    }

    cout << ans << endl;

    return 0;
}