/*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
ll dp_v[2][100001] = {};
ll dp_r[2][100001] = {};
ll sum[100010] = {};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,M;
    cin >> N >> M;
    ll V[110], R[110];
    rep(i,0,N) cin >> V[i];
    rep(i,0,M) cin >> R[i];
    ll A,B;
    cin >> A >> B;
    dp_v[0][0] = 1;
    dp_r[0][0] = 1;
    ll cur = 0, nxt = 1;
    ll max_val = N * 1000;
    rep(i,0,N){
        rep(j,0,max_val+1){
            dp_v[nxt][j] = 0;
        }
        rep(j,0,max_val+1){
            if(j - V[i] >= 0){
                dp_v[nxt][j] += dp_v[cur][j-V[i]];
                dp_v[nxt][j] %= MOD;
            }
            dp_v[nxt][j] += dp_v[cur][j];
            dp_v[nxt][j] %= MOD;
        }
        cur ^= 1; nxt ^= 1;
    }

    ll cur2 = 0, nxt2 = 1;

    max_val = M * 1000;
    rep(i,0,M){
        rep(j,0,max_val+1){
            dp_r[nxt2][j] = 0;
        }
        rep(j,0,max_val+1){
            if(j - R[i] >= 0){
                dp_r[nxt2][j] += dp_r[cur2][j-R[i]];
                dp_r[nxt2][j] %= MOD;
            }
            dp_r[nxt2][j] += dp_r[cur2][j];
            dp_r[nxt2][j] %= MOD;
        }
        cur2 ^= 1; nxt2 ^= 1;
    }

    rep(i,0,N*1000+1){
        sum[i+1] = sum[i] + dp_v[cur][i];
        sum[i+1] %= MOD;
    }

    ll ans = 0;
    rep(j,1,M*1000+1){
        ll lv = A * j;
        ll rv = B * j;
        if(lv > N * 1000) continue;
        if(rv > N * 1000) rv = N * 1000; 
        ans += dp_r[cur2][j] * (sum[rv+1] - sum[lv] + MOD) % MOD;
        ans %= MOD;
    }
    print(ans);

}