#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
typedef complex<double> xy_t;
typedef vector<lint> poly;

const lint mod = 1e9 + 7;
const lint INF = mod * mod;
const int MAX = 100010;

lint dpv[2][MAX], dpr[2][MAX], vsum[MAX];

int main(){
    int n, m;
    scanf("%d%d", &n, &m);
    int v[n], r[m];
    rep(i, n) scanf("%d", &v[i]);
    rep(i, m) scanf("%d", &r[i]);
    lint a, b;
    scanf("%lld%lld", &a, &b);

    rep(i, 2)rep(j, MAX) dpv[i][j] = 0;
    rep(i, 2)rep(j, MAX) dpr[i][j] = 0;
    dpv[0][0] = dpr[0][0] = 1;
    rep(i, n){
        rep(j, MAX)if(dpv[i&1][j]){
            (dpv[(i+1)&1][j] += dpv[i&1][j]) %= mod;
            if(j+v[i] < MAX) (dpv[(i+1)&1][j+v[i]] += dpv[i&1][j]) %= mod;
        }
        rep(j, MAX) dpv[i&1][j] = 0;
    }
    rep(i, m){
        rep(j, MAX)if(dpr[i&1][j]){
            (dpr[(i+1)&1][j] += dpr[i&1][j]) %= mod;
            if(j+r[i] < MAX) (dpr[(i+1)&1][j+r[i]] += dpr[i&1][j]) %= mod;
        }
        rep(j, MAX) dpr[i&1][j] = 0;
    }

    vsum[1] = 0;
    rep(i, MAX-2) vsum[i+2] = (vsum[i+1] + dpv[n&1][i+1]) % mod;
    lint ans = 0;
    For(i, 1, MAX)if(dpr[m&1][i]){
        lint L = a*i, R = b*i + 1;
        (ans += (vsum[min((lint)MAX, R)]+mod-vsum[min((lint)MAX, L)])%mod * dpr[m&1][i] % mod) %= mod;
    }
    printf("%lld\n", ans);
}