#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>

#define int long long
#define x first
#define y second
#define ps push_back
#define endl '\n'

#define kd                     \
  ios::sync_with_stdio(false); \
  cin.tie(0);                  \
  cout.tie(0);
using namespace std;
typedef pair<int, int> pi;
const int N = 2e6 + 100, mod = 1e9 + 7, INF = 1e10;
int lowbit(int x) { return x & -x; }
int gcd(int a, int b) { return a % b == 0 ? b : gcd(b, a % b); }

int a[N], b[N];

void solve() {
  int n, m, l, r;
  while (cin >> n >> m >> l >> r) {
    for (int i = 0; i <= n; i++) {
      cin >> a[i];
      if (i) a[i] += a[i - 1];
      a[i] %= mod;
    }
    for (int i = 0; i <= m; i++) {
      cin >> b[i];
    }

    int ans = 0;
    for (int i = 0; i <= m; i++) {
      int sr = r - i;
      sr = min(sr, n);
      if (sr < 0) continue;
      int sl = l - i;
      if (sl > n) continue;
      sl = max(0ll, sl);

      int tt;
      if (sl == 0)
        tt = 0;
      else
        tt = a[sl - 1];
      int ra = a[sr] - tt;
      ra = (ra % mod + mod) % mod;
      int res2 = b[i] * (ra) % mod;
      res2 = (res2 + mod) % mod;
      ans = (ans + res2) % mod;
    }
    cout << (ans % mod + mod) % mod << endl;
  }
}

signed main() {
  kd;
  int _;
  _ = 1;
  // cin>>_;
  while (_--) solve();
  return 0;
}