#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=1e9+7;
signed main(){
    ll n,m;cin>>n>>m;
    vector<ll>v(n);
    vector<ll>r(m);
    rep(i,n)cin>>v[i];
    rep(i,m)cin>>r[i];
    ll a,b;cin>>a>>b;
    vector<vector<ll> >dp(n+1,vector<ll>(100010));
    vector<vector<ll> >dp2(m+1,vector<ll>(100010));
    dp[0][0]=1;
    rep(i,n){
        rep(j,100010){
            if(dp[i][j]==0)continue;
            dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
            dp[i+1][j+v[i]]=(dp[i+1][j+v[i]]+dp[i][j])%mod;
        }
    }
    dp2[0][0]=1;
    rep(i,m){
        rep(j,100010){
            if(dp2[i][j]==0)continue;{
                dp2[i+1][j]=(dp2[i+1][j]+dp2[i][j])%mod;
                dp2[i+1][j+r[i]]=(dp2[i+1][j+r[i]]+dp2[i][j])%mod;
            }
        }
    }
    REP(i,1,100001){
        dp[n][i]=(dp[n][i]+dp[n][i-1])%mod;
    }
    ll ans=0;
    REP(i,1,100001){
        ll c=dp2[m][i];
        ll d;
        if(i*a>100000)d=0;
        else{
            if(i*b>100000)d=(dp[n][100000]-dp[n][a*i-1])%mod;
            else d=(dp[n][b*i]-dp[n][a*i-1])%mod;
        }
        ans=(ans+c*d%mod)%mod;
    }
    if(ans<0)ans+=mod;
    cout<<ans<<endl;
}