#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, M; cin >> N >> M;
	VI V(N), R(M);
	REP(i, N)cin >> V[i];
	REP(i, M)cin >> R[i];
	int A, B; cin >> A >> B;
	SORT(V);
	SORT(R);

	int dp1[2][100010] = { 0 }, dp2[2][100010] = { 0 };
	dp1[0][0] = dp2[0][0] = 1;

	REP(i, N) {
		REP(j, 100010) {
			dp1[(i + 1) % 2][j] += dp1[i % 2][j];
			if (j + V[i] < 100010) {
				dp1[(i + 1) % 2][j + V[i]] += dp1[i % 2][j];
			}
		}
		REP(j, 100010)dp1[i % 2][j] = 0;
	}



	REP(i, M) {
		REP(j, 100010) {
			dp2[(i + 1) % 2][j] += dp2[i % 2][j];
			if (j + R[i] < 100010) {
				dp2[(i + 1) % 2][j + R[i]] += dp2[i % 2][j];
			}
		}
		REP(j, 100010)dp2[i % 2][j] = 0;;
	}

	int ans = 0;
	int cnt[100010] = { 0 };
	cnt[0] = dp1[N % 2][0];
	FOR(i, 1, 100010) {
		cnt[i] = cnt[i - 1] + dp1[N % 2][i];
		cnt[i] %= mod;
	}
	eFOR(i, 1, 100000) {
		int ma = B * i, mi = A * i;
		mi--;
		if (mi >= 100000) {
			continue;
		}
		chmin(ma, 100000LL);
		chmin(mi, 100000LL);

		if (mi == -1) {
			ans += cnt[ma] * dp2[M % 2][i];
		}
		else ans += (cnt[ma] - cnt[mi] + mod)*dp2[M % 2][i];

		ans %= mod;
	}



	cout << ans << endl;
	return 0;
}