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

#define rep(i,m,n) for(int (i)=(int)(m);i<(int)(n);i++)
#define rep2(i,m,n) for(int (i)=(int)(n)-1;i>=(int)(m);i--)
#define REP(i,n) rep(i,0,n)
#define REP2(i,n) rep2(i,0,n)
#define FOR(i,c) for(decltype((c).begin())i=(c).begin();i!=(c).end();++i)
#define all(hoge) (hoge).begin(),(hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll) 1e9 + 7;
//constexpr long long MOD = 998244353LL;
typedef vector<ll> Array;
typedef vector<Array> Matrix;


template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct Edge {
	ll to, cap, rev;
	Edge(ll _to, ll _cap, ll _rev) {
	to = _to; cap = _cap; rev = _rev;
	}
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;

void add_edge(Graph& G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
	G[from].push_back(Edge(to, cap, (ll)G[to].size()));
	if (revFlag)G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

using dd=long double;

void solve(){
    ll n,m;
    cin>>n>>m;
    Array v(n),r(m);
    REP(i,n) cin>>v[i];
    REP(i,m) cin>>r[i];
    ll a,b;
    cin>>a>>b;

    ll ma=100*1000;
    Matrix dpv(n+1,Array(ma+1,0));
    dpv[0][0]=1;
    REP(i,n){
        REP(j,ma+1){
            if(dpv[i][j]==0) continue;
            (dpv[i+1][j]+=dpv[i][j])%=MOD;
            (dpv[i+1][j+v[i]]+=dpv[i][j])%=MOD;
        }
    }

    Matrix dpr(m+1,Array(ma+1,0));
    dpr[0][0]=1;
    REP(i,m){
        REP(j,ma+1){
            if(dpr[i][j]==0) continue;
            (dpr[i+1][j]+=dpr[i][j])%=MOD;
            (dpr[i+1][j+r[i]]+=dpr[i][j])%=MOD;
        }
    }

    Array sum(ma+2,0);
    REP(i,ma+1) sum[i+1]=(sum[i] + dpv[n][i]);

    ll ans=0;
    for(ll i=1;i<=ma;i++){
        ll l=i*a;
        ll rr=i*b;
        ll ret=(MOD+sum[min(rr,ma)+1]-sum[min(l,ma)])%MOD;
        (ret *= dpr[m][i])%=MOD;
        (ans+=ret)%=MOD;
    }

    cout<<ans<<en;

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    solve();
    //ll t;cin>>t;REP(i,t) solve();

    return 0;
}