#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9+7;
ll dpV[101][100001],dpR[101][100001];

int main()
{
	ll n,m;
	cin >> n >> m;
	vector<ll> V(n),R(m);
	for(ll i = 0;i<n;i++)cin >> V[i];
	for(ll i = 0;i<m;i++)cin >> R[i];
	ll A,B;
	cin >> A >> B;
	dpV[0][0]=dpR[0][0]=1;
	for(ll i = 0;i<n;i++)
	{
		for(ll j = 0;j<100001;j++)
		{
			if(dpV[i][j])
			{
				(dpV[i+1][j]+=dpV[i][j])%=MOD;
				(dpV[i+1][j+V[i]]+=dpV[i][j])%=MOD;
			}
		}
	}
	for(ll i =0;i<m;i++)
	{
		for(ll j = 0;j<100001;j++)
		{
			if(dpR[i][j])
			{
				(dpR[i+1][j]+=dpR[i][j])%=MOD;
				(dpR[i+1][j+R[i]]+=dpR[i][j])%=MOD;
			}
		}
	}
	ll ans = 0;
	dpR[m][0] = 0;
	vector<ll> sum(100002);
	for(ll i = 0;i<100001;i++)
	{
		(sum[i+1] += sum[i]+dpR[m][i])%=MOD;
		//cout<<sum[i+1]<<endl;
	}
	
	for(ll i = 1;i<100001;i++)
	{
		ll r,l;
		l = (i+B-1)/B;
		r = (i)/A;
		//cout<<i<<';'<<r<<' '<<l<<endl;
	(ans += ((sum[r+1]-sum[l])*dpV[n][i])%MOD)%=MOD;
		//cout<<ans<<endl;
	}
	cout<<ans<<endl;

}