#include using namespace std; #define DEBUG(x) cerr<<#x<<": "< #define vl vector #define vii vector< vector > #define vll vector< vector > #define vs vector #define pii pair #define pis pair #define psi pair #define pll pair template pair operator+(const pair &s, const pair &t) { return pair(s.first + t.first, s.second + t.second); } template pair operator-(const pair &s, const pair &t) { return pair(s.first - t.first, s.second - t.second); } template ostream& operator<<(ostream& os, pair p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(int)(n);i++) #define rep1(i,n) for(int i=1;i<=(int)(n);i++) #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(int)(n);i>0;i--) #define REP(i,a,b) for(int i=a;i bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const long double pi = 3.1415926535897932384626433832795028841971L; #define Sp(p) cout<> n >> m; vi v(n), r(m); rep (i, n) cin >> v[i]; rep (j, m) cin >> r[j]; vl a = fill_dp(v), b = fill_dp(r); // DEBUG_VEC(a); // DEBUG_VEC(b); vl sum(a.size() + 1); rep (i, a.size()) { sum[i + 1] = sum[i] + a[i]; sum[i + 1] %= MOD; } ll A, B; cin >> A >> B; // DEBUG_VEC(sum); ll ans = 0; for (int i = 1; i < b.size(); i++) { if (b[i] == 0) continue; int x = i; if (A * x >= a.size()) continue; ans += (sum[min(B * x + 1, (ll)a.size())] - sum[min(A * x, (ll)a.size())]) * b[i] % MOD; } ans %= MOD; cout << ans << endl; }