#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll N, M; cin >> N >> M;
  ll V[N]; rep(i,N) cin >> V[i];
  ll R[M]; rep(i,M) cin >> R[i];
  ll A, B; cin >> A >> B;

  ll dpv[N+1][1000*N+1] = {}; dpv[0][0] = 1;
  rep(i,N) rep(j,1000*N+1) {
    dpv[i+1][j] = (dpv[i+1][j] + dpv[i][j]) % MOD;
    if (V[i]+j<=1000*N) dpv[i+1][V[i]+j] = (dpv[i+1][V[i]+j] + dpv[i][j]) % MOD;
  }

  ll dpr[M+1][1000*M+1] = {}; dpr[0][0] = 1;
  rep(i,M) rep(j,1000*M+1) {
    dpr[i+1][j] = (dpr[i+1][j] + dpr[i][j]) % MOD;
    if (R[i]+j<=1000*M) dpr[i+1][R[i]+j] = (dpr[i+1][R[i]+j] + dpr[i][j]) % MOD;
  }

  ll sv[1000*N+2] = {}; rep(i,1000*N+1) sv[i+1] = (sv[i]+dpv[N][i]) % MOD;
  // debug(sv,sv+20);

  ll result = 0;
  repr(i,1,1000*M+1) {
    if (i*B>1000*N) break;
    result = ( result + (sv[i*B+1]-sv[i*A])*dpr[M][i] ) % MOD;
  }
  cout << result << endl;
  return 0;
}