#include <functional>  
#include <algorithm>  
#include <iostream>  
#include <fstream>  
#include <sstream>  
#include <iomanip>  
#include <numeric>  
#include <cstring>  
#include <cassert>  
#include <cstdio>  
#include <string>  
#include <vector>  
#include <bitset>  
#include <queue>  
#include <stack>  
#include <cmath>  
#include <ctime>  
#include <list>  
#include <set>  
#include <map>  
#include <bits/stdc++.h>

using namespace std;

#define PB push_back  
#define MP(A, B) make_pair(A, B)  
#define fi first  
#define se second  

#define gcd(a,b) __gcd(a,b)
#define pi acos(-1.0)
#define pii pair<int,int>
#define ll long long  
#define MAX 1000005  
#define MOD 1000000007  
#define INF 0x3f3f3f3f  
#define EXP 1e-8  
#define lowbit(x) (x&-x)  
ll qpow(ll p,ll q){ll f=1;while(q){if(q&1)f=f*p;p=p*p;q>>=1;}return f;}

struct hash_pair { 
    template <class T1, class T2> 
    size_t operator()(const pair<T1, T2>& p) const
    { 
        auto hash1 = hash<T1>{}(p.first); 
        auto hash2 = hash<T2>{}(p.second); 
        return hash1 ^ hash2; 
    } 
}; 

int v[105] = {0}, r[105] = {0};
unordered_map<long long, ll> vp, rp;
unordered_map<long long, ll> vpa, rpa;
vector<ll> rpr(100005, 0), rprs(100005, 0);
vector<ll> vl, rl;
vector<ll> rls;
int main() {
    int n, m, a, b;
    long long ans = 0;
    cin >> n >> m;
    for (int i = 0; i < n; ++i) cin >> v[i];
    for (int i = 0; i < m; ++i) cin >> r[i];
    cin >> a >> b;

    vl.push_back(0); vp[0] = 1;
    for (int i = 0; i < n; ++i) {
        int vll = vl.size();
        long long vn = v[i];
        for (int j = vll-1; j >= 0; j--) {
            if (!vp.count(vn + vl[j])) {
                vl.push_back(vn + vl[j]);
            }
            vp[vn+vl[j]] += vp[vl[j]];
            vp[vn+vl[j]] %= MOD;
        }
    }

    for (int i = 0; i < m; ++i) {
        rpa = rp;
        int rll = rl.size();
        ll rn = r[i];
        if (!rp.count(rn)) rl.push_back(rn);
        rpa[rn]++;
        rpa[rn] %= MOD;
        for (int j = 0; j < rll; ++j) {
            if (!rp.count(rn + rl[j])) {
                rl.push_back(rn + rl[j]);
            }
            rpa[rn+rl[j]]+=rp[rl[j]];
            rpa[rn+rl[j]] %= MOD;
        }
        rp = rpa;
    }

    for (auto &a:rl) rpr[a] = rp[a];
    rprs[0] = rpr[a];
    for (int i = 0; i <= 100000; ++i) rprs[i] = rprs[i-1] + rpr[i], rprs[i] %= MOD;

    for (int i = 1; i < vl.size(); ++i) {
        double lb = vl[i] / (double)b, hb = vl[i] / (double)a;
        int llb = ceil(lb), hhb = floor(hb);
        ans = ans + (vp[vl[i]] % MOD) * ((rprs[hhb] - rprs[llb-1] + MOD) % MOD) % MOD;
        ans %= MOD;
    }
    cout << ans << endl;
    return 0;
}