#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) (a)=max(a, b)
#define chmin(a, b) (a)=min(a, b)
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;

/*
 for(i=0; i<N; i++)
   cin >> a[i];
*/


ll dp[111][MAX];
ll ep[111][MAX];

int main(void) {
  ll i, j, k;
  
  ll N, M;
  ll v[111], r[111];
  ll A, B;
  
  cin >> N >> M;
  for(i=0; i<N; i++) cin >> v[i];
  for(i=0; i<M; i++) cin >> r[i];
  cin >> A >> B;
  
  dp[0][0]=1;
  for(i=0; i<N; i++) {
    for(j=0; j<MAX; j++) {
      moC(dp[i+1][j], +, dp[i][j]);
      if(j+v[i]<MAX) moC(dp[i+1][j+v[i]], +, dp[i][j]);
    }
  }
  
  ep[0][0]=1;
  for(i=0; i<M; i++) {
    for(j=0; j<MAX; j++) {
      moC(ep[i+1][j], +, ep[i][j]);
      if(j+r[i]<MAX) moC(ep[i+1][j+r[i]], +, ep[i][j]);
    }
  }
  
  ll s[MAX]={};
  for(i=1; i<MAX; i++) s[i]=(s[i-1]+ep[M][i])%MOD;
  
  ll ans=0;
  for(i=1; i<MAX; i++) {
    ll p=(i+B-1)/B;
    ll q=i/A;
    
    moC(ans, +, dp[N][i]*(s[q]-s[p-1]+MOD)%MOD);
  }
  
  pt(ans);
  
}