#include #include using namespace std; #define reps(i,s,n) for(int i = s; i < n; i++) #define rep(i,n) reps(i,0,n) #define Rreps(i,n,e) for(int i = n - 1; i >= e; --i) #define Rrep(i,n) Rreps(i,n,0) #define ALL(a) a.begin(), a.end() #define fi first #define se second typedef long long ll; typedef vector vec; typedef vector mat; ll N,M,H,W,Q,K,A,B; string S; const ll MOD = 998244353; //const ll MOD = (1e+9) + 7; typedef pair P; class mint{ public: ll x; static unsigned long long mod; static unsigned long long mod_plus; mint(){x = 0;} mint(ll _x) : x((_x < 0 ? ((_x += mod_plus) < 0 ? _x + mod_plus : _x) : _x)%mod){} /*mint& operator=(const ll &a){ x = a; return *this; }*/ mint operator-(){ return x == 0 ? 0 : mod - x; } mint& operator+=(const mint& a){ if((x += a.x) >= mod) x -= mod; return *this; } mint operator+(const mint& a) const{ mint res(*this); return res += a; } mint& operator-=(const mint& a){ if((x -= a.x) < 0) x += mod; return *this; } mint operator-(const mint& a) const{ mint res(*this); return res -= a; } mint& operator*=(const mint& a){ (x *= a.x)%=mod; return *this; } /*mint& operator*=(const ll& a){ mint temp(a); return *this *= temp; }*/ mint operator*(const mint& a) const{ mint res(*this); return res *= a; } /*mint operator*(const ll& a) const{ mint res(*this); return res *= a; }*/ mint pow(unsigned long long pw) const{ mint res(1), comp(*this); while(pw){ if(pw&1) res *= comp; comp *= comp; pw >>= 1; } return res; } //以下、modが素数のときのみ mint inv() const{ mint res(*this); return res.pow(mod - 2); } mint& operator/=(const mint &a){ (x *= a.inv().x)%=mod; return *this; } mint operator/(const mint &a) const{ mint res(*this); return res /= a; } }; ostream& operator<<(ostream& os, const mint& a){ os << a.x; return os; } unsigned long long mint::mod = int(1e+9) + 7; unsigned long long mint::mod_plus = (LLONG_MAX / mint::mod) * mint::mod; typedef vector vm; void npsk(ll n, vector &dp, vec &a){ dp[0][0] = 1; rep(i,n){ rep(j, int(1e+5) + 1){ dp[i+1][j] += dp[i][j]; if(j + a[i] <= int(1e+5)) dp[i+1][j + a[i]] += dp[i][j]; } } } int main() { cin>>N>>M; vec v(N), r(M); rep(i,N) cin>>v[i]; rep(i,M) cin>>r[i]; cin>>A>>B; vector dpv(N + 1, vm(int(1e+5) + 1, 0)), dpr(M + 1, vm(int(1e+5) + 1, 0)); npsk(N, dpv, v); npsk(M, dpr, r); rep(j,int(1e+5)) dpv[N][j+1] += dpv[N][j]; vm &sum = dpv[N]; mint ans(0); reps(i,1,int(1e+5) + 1){ ans += dpr[N][i] * (sum[min(ll(i) * B, ll(1e+5))] - sum[min(ll(i) * A - 1, ll(1e+5))]); } cout<