/** * @FileName f.cpp * @Author kanpurin * @Created 2020.05.13 11:48:22 **/ #include "bits/stdc++.h" using namespace std; typedef long long ll; constexpr int MOD = 1e9 + 7; struct mint { private: long long x; public: mint(long long x = 0) :x((MOD+x)%MOD) {} mint(std::string &s) { long long z = 0; for (int i = 0; i < s.size(); i++) { z *= 10; z += s[i] - '0'; z %= MOD; } this->x = z; } mint& operator+=(const mint &a) { if ((x += a.x) >= MOD) x -= MOD; return *this; } mint& operator-=(const mint &a) { if ((x += MOD - a.x) >= MOD) x -= MOD; return *this; } mint& operator*=(const mint &a) { (x *= a.x) %= MOD; return *this; } mint& operator/=(const mint &a) { long long n = MOD - 2; mint u = 1, b = a; while (n > 0) { if (n & 1) { u *= b; } b *= b; n >>= 1; } return *this *= u; } mint operator+(const mint &a) const { mint res(*this); return res += a; } mint operator-(const mint &a) const { mint res(*this); return res -= a; } mint operator*(const mint &a) const { mint res(*this); return res *= a; } mint operator/(const mint &a) const { mint res(*this); return res /= a; } friend std::ostream& operator<<(std::ostream &os, const mint &n) { return os << n.x; } bool operator==(const mint &a) const { return this->x == a.x; } }; int main() { int n,m;cin >> n >> m; vector v(100001,0),r(100001,0); v[0] = 1; r[0] = 1; for (int _ = 0; _ < n; _++) { int _v;cin >> _v; for (int i = 100000; i >= _v; i--) { v[i] += v[i-_v]; } } for (int _ = 0; _ < m; _++) { int _r;cin >> _r; for (int i = 100000; i >= _r; i--) { r[i] += r[i-_r]; } } for (int i = 0; i < 100000; i++) { v[i + 1] += v[i]; } ll a,b;cin >> a >> b; int range = 100000 / a; mint ans = 0; for (int i = 1; i <= 100000; i++) { if (a*i-1 >= 0) ans += (v[min(100000LL,b*i)] - v[min(100000LL,a*i-1)]) * r[i]; else ans += v[min(100000LL,b*i)] * r[i]; } cout << ans << endl; return 0; }