#include "bits/stdc++.h" using namespace std; #define int long long #define FOR(i, a, b) for(int i=(a);i<(b);i++) #define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--) #define REP(i, n) for(int i=0; i<(n); i++) #define RREP(i, n) for(int i=(n-1); i>=0; i--) #define REP1(i, n) for(int i=1; i<=(n); i++) #define RREP1(i, n) for(int i=(n); i>=1; i--) #define ALL(a) (a).begin(),(a).end() #define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end()); #define CONTAIN(a, b) find(ALL(a), (b)) != (a).end() #define out(...) printf(__VA_ARGS__) #if DEBUG #define debug(...) printf(__VA_ARGS__) #else #define debug(...) /* ... */ #endif void solve(); signed main() { #if DEBUG std::ifstream in("input.txt"); std::cin.rdbuf(in.rdbuf()); #endif cin.tie(0); ios::sync_with_stdio(false); solve(); return 0; } /*================================*/ #if DEBUG #define SIZE 10 int MAX=1e5+10; #else #define SIZE 123 int MAX=1e5+10; #endif int N,M,V[SIZE],R[SIZE],A,B; int MOD=1e9+7; template class ST { using F = function; int size; T init; F f; vector seg; int depth = 0; public: ST(int size, T init, F f): size(size), init(init), f(f) { while (1<>=1) seg[k] = f(seg[2*k], seg[2*k+1]); } T query(int a, int b) { a += 1<>= 1; b >>= 1; } return f(l, r); } T operator[] (int k) { return seg[k + (1< struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template ostream& operator<<(ostream& st, const ModInt a) { st << a.get(); return st; }; template ModInt operator^(ModInt a, unsigned long long k) { ModInt r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } typedef ModInt<1000000007> mint; vector DPV(MAX,0),DPR(MAX,0); void solve() { cin>>N>>M; REP(i,N)cin>>V[i]; REP(i,M)cin>>R[i]; cin>>A>>B; DPV[0]=1; DPR[0]=1; REP(i,N)RREP(j,MAX) { int nv = j + V[i]; if (nv(MAX,0,[](mint a,mint b){return a+b;}); REP(j,MAX) { st.update(j, DPV[j].get()); } mint ans = 0; REP(j, MAX-1) if (j&&DPR[j].get()) { mint add = DPR[j] * st.query(min(A*j,MAX-5), min(B*j+1,MAX-5)); debug("j:%lld, DPR[j]:%lld, add:%lld\n", j, DPR[j],add); ans += add; } cout << ans << endl; }