#include <cmath>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 1000000007;
int main() {
	int N, M;
	cin >> N >> M;
	vector<int> V(N), R(M);
	int sv = 0, sr = 0;
	for (int i = 0; i < N; ++i) {
		cin >> V[i];
		sv += V[i];
	}
	for (int i = 0; i < M; ++i) {
		cin >> R[i];
		sr += R[i];
	}
	int A, B;
	cin >> A >> B;
	vector<int> dp1(sv + 1), dp2(sr + 1);
	dp1[0] = 1, dp2[0] = 1;
	for (int i = 0; i < N; ++i) {
		for (int j = sv; j >= V[i]; --j) {
			dp1[j] += dp1[j - V[i]];
			if (dp1[j] >= mod) dp1[j] -= mod;
		}
	}
	for (int i = 0; i < M; ++i) {
		for (int j = sr; j >= R[i]; --j) {
			dp2[j] += dp2[j - R[i]];
			if (dp2[j] >= mod) dp2[j] -= mod;
		}
	}
	vector<int> sdp1(sv + 2);
	for (int i = 0; i <= sv; ++i) {
		sdp1[i + 1] = sdp1[i] + dp1[i];
		if (sdp1[i + 1] >= mod) sdp1[i + 1] -= mod;
	}
	int ans = 0;
	for (int i = 1; i <= sr; ++i) {
		int pl = min(1LL * i * A, sv + 1LL), pr = min(1LL * i * B + 1, sv + 1LL);
		ans = (ans + 1LL * dp2[i] * (sdp1[pr] - sdp1[pl] + mod)) % mod;
	}
	cout << ans << endl;
	return 0;
}