#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 1000000000


int main(){
	
	int N,M;
	cin>>N>>M;
	
	vector<int> V(N),R(M);
	
	for(int i=0;i<N;i++)cin>>V[i];
	for(int i=0;i<M;i++)cin>>R[i];
	
	int t = 100001;
	
	vector<vector<int>> dp1(N+1,vector<int>(t,0)),dp2(M+1,vector<int>(t,0));
	dp1[0][0]=1,dp2[0][0]=1;
	
	for(int i=0;i<N;i++){
		for(int j=0;j<t;j++){
			if(dp1[i][j]==0)continue;
			dp1[i+1][j] = mod(dp1[i+1][j]+dp1[i][j]);
			dp1[i+1][j+V[i]] = mod(dp1[i+1][j+V[i]]+dp1[i][j]);
		}
	}
	
	for(int i=0;i<M;i++){
		for(int j=0;j<t;j++){
			if(dp2[i][j]==0)continue;
			dp2[i+1][j] = mod(dp2[i+1][j]+dp2[i][j]);
			dp2[i+1][j+R[i]] = mod(dp2[i+1][j+R[i]] + dp2[i][j]);
		}
	}
	
	for(int i=1;i<t;i++){
		dp1.back()[i] = mod(dp1.back()[i] + dp1.back()[i-1]);
	}
	
	/*
	
	for(int i=0;i<10;i++){
		cout<<dp1.back()[i]<<',';
	}
	cout<<endl;
	*/
	int ans = 0;
	int A,B;
	cin>>A>>B;
	for(int i=1;i<t;i++){
		long long a = (long long)A*i,b = (long long)B*i;
		int temp = 0;
		if(b<t){
			temp = dp1.back()[b];
		}
		else temp=dp1.back().back();
		
		if(a-1<t){
			temp = mod(temp - dp1.back()[a-1]);
		}
		else{
			temp = 0;
		}
		
		ans = mod(ans + mod(temp * dp2.back()[i]));
	}
	
	cout<<ans<<endl;
	
	return 0;
}