#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 1e9 + 7;
constexpr int VMAX = 100001;
constexpr int RMAX = 100001;
int main(){ 
  int n, m;
  cin >> n >> m;
  vector<int> v(n), r(m);
  rep(i,n) cin >> v[i];
  rep(i,m) cin >> r[i];
  ll a, b;
  cin >> a >> b;
  vector<ll> dp1(VMAX, 0), dp2(RMAX, 0);

  dp1[0] = 1;
  dp2[0] = 1;

  for (int i = 0; i < n; i++) {
    for (int j = VMAX; j >= 0; j--) {
      if (j + v[i] < VMAX) (dp1[j + v[i]] += dp1[j]) %= mod;
    }
  }

  for (int i = 0; i < m; i++) {
    for (int j = RMAX; j >= 0; j--) {
      if (j + r[i] < RMAX) (dp2[j + r[i]] += dp2[j] %= mod);
    }
  }

  vector<ll> cum(VMAX + 1, 0);

  for (int i = 0; i < VMAX; i++) {
    (cum[i + 1] = cum[i] + dp1[i]) %= mod;
  }

  ll res = 0;

  for (int i = 1; i < RMAX; i++) {
    ll l = min((ll)100000, a * i), r = min((ll)100000, b * i);

    ll sum = (cum[(int)r + 1] - cum[(int)l] + mod) % mod;
    (res += dp2[i] * sum % mod) %= mod;

  }

  cout << res << endl;
  return 0;
}