#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

ll d[100001],c[100001];

void Main() {
  ll n,m;
  cin >> n >> m;
  ll a[n],b[m],x,y;
  rep(i,n) cin >> a[i];
  rep(i,m) cin >> b[i];
  cin >> x >> y;
  d[0]=c[0]=1;
  rep(i,n) {
    rrep(j,100001) {
      if(j+a[i]<100001) {
        d[j+a[i]]+=d[j];
        d[j+a[i]]%=MAX;
      }
    }
  }
  rep(i,m) {
    rrep(j,100001) {
      if(j+b[i]<100001) {
        c[j+b[i]]+=c[j];
        c[j+b[i]]%=MAX;
      }
    }
  }
  rep(i,100000) {
    d[i+1]+=d[i];
    d[i+1]%=MAX;
  }
  ll ans=0;
  REP(i,1,100001) {
    ll l1=0,r1=100001;
    while(l1+1<r1) {
      ll m=(l1+r1)/2;
      double e=(double)m/i;
      if(e<x) l1=m;
      else r1=m;
    }
    ll l2=0,r2=100000;
    while(l2+1<r2) {
      ll m=(l2+r2)/2;
      double e=(double)m/i;
      if(e<y) l2=m;
      else r2=m;
    }
    l1=min(l1,r2);
    ll dd=d[r2]-d[l1];
    ans+=dd*c[i];
    ans%=MAX;
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}